./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 307542ef0214b83df72c59e51df6e57e6557ac8b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:28:07,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:28:07,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:28:07,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:28:07,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:28:07,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:28:07,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:28:07,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:28:07,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:28:07,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:28:07,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:28:07,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:28:07,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:28:07,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:28:07,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:28:07,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:28:07,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:28:07,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:28:07,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:28:07,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:28:07,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:28:07,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:28:07,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:28:07,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:28:07,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:28:07,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:28:07,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:28:07,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:28:07,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:28:07,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:28:07,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:28:07,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:28:07,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:28:07,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:28:07,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:28:07,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:28:07,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:28:07,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:28:07,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:28:07,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:28:07,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:28:07,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:28:07,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:28:07,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:28:07,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:28:07,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:28:07,192 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:28:07,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:28:07,192 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:28:07,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:28:07,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:28:07,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:28:07,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:28:07,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:28:07,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:28:07,194 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:28:07,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:28:07,195 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:28:07,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:28:07,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:28:07,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:28:07,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:28:07,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:28:07,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:07,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:28:07,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:28:07,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:28:07,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:28:07,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:28:07,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:28:07,199 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:28:07,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 307542ef0214b83df72c59e51df6e57e6557ac8b [2019-11-28 17:28:07,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:28:07,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:28:07,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:28:07,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:28:07,547 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:28:07,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann04.c [2019-11-28 17:28:07,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf14542f/72dc3385be9a4fd386dc8ebcce32e8a2/FLAGd2f018bec [2019-11-28 17:28:08,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:28:08,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2019-11-28 17:28:08,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf14542f/72dc3385be9a4fd386dc8ebcce32e8a2/FLAGd2f018bec [2019-11-28 17:28:08,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf14542f/72dc3385be9a4fd386dc8ebcce32e8a2 [2019-11-28 17:28:08,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:28:08,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:28:08,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:08,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:28:08,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:28:08,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e68f3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08, skipping insertion in model container [2019-11-28 17:28:08,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:28:08,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:28:08,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:08,721 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:28:08,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:08,756 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:28:08,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08 WrapperNode [2019-11-28 17:28:08,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:08,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:08,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:28:08,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:28:08,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:08,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:28:08,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:28:08,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:28:08,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (1/1) ... [2019-11-28 17:28:08,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:28:08,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:28:08,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:28:08,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:28:08,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (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-11-28 17:28:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:28:08,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:28:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-11-28 17:28:08,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-11-28 17:28:09,124 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:28:09,125 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:28:09,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:09 BoogieIcfgContainer [2019-11-28 17:28:09,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:28:09,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:28:09,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:28:09,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:28:09,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:28:08" (1/3) ... [2019-11-28 17:28:09,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1485a683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:09, skipping insertion in model container [2019-11-28 17:28:09,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:08" (2/3) ... [2019-11-28 17:28:09,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1485a683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:09, skipping insertion in model container [2019-11-28 17:28:09,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:09" (3/3) ... [2019-11-28 17:28:09,137 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2019-11-28 17:28:09,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:28:09,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:28:09,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:28:09,235 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:28:09,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:28:09,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:28:09,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:28:09,238 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:28:09,238 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:28:09,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:28:09,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:28:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-28 17:28:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:28:09,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:09,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:09,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:09,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-11-28 17:28:09,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:09,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019611273] [2019-11-28 17:28:09,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:28:09,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019611273] [2019-11-28 17:28:09,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:09,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:28:09,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138410946] [2019-11-28 17:28:09,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:28:09,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:09,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:28:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:28:09,539 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-11-28 17:28:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:09,711 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2019-11-28 17:28:09,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:28:09,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 17:28:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:09,722 INFO L225 Difference]: With dead ends: 50 [2019-11-28 17:28:09,722 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 17:28:09,726 INFO L630 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-11-28 17:28:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 17:28:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 17:28:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 17:28:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-28 17:28:09,783 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2019-11-28 17:28:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:09,784 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 17:28:09,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:28:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-11-28 17:28:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:28:09,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:09,789 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:09,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-11-28 17:28:09,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:09,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851019495] [2019-11-28 17:28:09,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:28:09,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851019495] [2019-11-28 17:28:09,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167345896] [2019-11-28 17:28:09,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,035 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 17:28:10,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:28:10,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:10,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-28 17:28:10,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008022454] [2019-11-28 17:28:10,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:28:10,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:10,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:28:10,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:28:10,123 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 11 states. [2019-11-28 17:28:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:10,413 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-11-28 17:28:10,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:28:10,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 17:28:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:10,416 INFO L225 Difference]: With dead ends: 53 [2019-11-28 17:28:10,416 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:28:10,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:28:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:28:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 17:28:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:28:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-28 17:28:10,430 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2019-11-28 17:28:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:10,431 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 17:28:10,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:28:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-11-28 17:28:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:28:10,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:10,434 INFO L410 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] [2019-11-28 17:28:10,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:10,639 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-11-28 17:28:10,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:10,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407586948] [2019-11-28 17:28:10,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:28:10,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407586948] [2019-11-28 17:28:10,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128500458] [2019-11-28 17:28:10,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:28:10,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:28:11,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:11,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-11-28 17:28:11,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106511416] [2019-11-28 17:28:11,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:28:11,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:11,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:28:11,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:28:11,067 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 14 states. [2019-11-28 17:28:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:11,684 INFO L93 Difference]: Finished difference Result 83 states and 166 transitions. [2019-11-28 17:28:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:28:11,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-28 17:28:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:11,689 INFO L225 Difference]: With dead ends: 83 [2019-11-28 17:28:11,690 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 17:28:11,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:28:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 17:28:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-11-28 17:28:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 17:28:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2019-11-28 17:28:11,714 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 31 [2019-11-28 17:28:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:11,714 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2019-11-28 17:28:11,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:28:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2019-11-28 17:28:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 17:28:11,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:11,718 INFO L410 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] [2019-11-28 17:28:11,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:11,921 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:11,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1827824897, now seen corresponding path program 2 times [2019-11-28 17:28:11,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:11,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979420739] [2019-11-28 17:28:11,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 17:28:12,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979420739] [2019-11-28 17:28:12,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695985168] [2019-11-28 17:28:12,145 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:12,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:12,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:12,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:28:12,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 17:28:12,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:12,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 17:28:12,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151848345] [2019-11-28 17:28:12,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:28:12,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:12,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:28:12,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:28:12,236 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 9 states. [2019-11-28 17:28:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:12,412 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2019-11-28 17:28:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:28:12,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-11-28 17:28:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:12,415 INFO L225 Difference]: With dead ends: 119 [2019-11-28 17:28:12,415 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 17:28:12,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:28:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 17:28:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 17:28:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 17:28:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2019-11-28 17:28:12,429 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2019-11-28 17:28:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:12,430 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-28 17:28:12,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:28:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2019-11-28 17:28:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 17:28:12,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:12,433 INFO L410 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] [2019-11-28 17:28:12,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:12,637 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:12,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1207723706, now seen corresponding path program 3 times [2019-11-28 17:28:12,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:12,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001393085] [2019-11-28 17:28:12,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 17:28:13,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001393085] [2019-11-28 17:28:13,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194335416] [2019-11-28 17:28:13,047 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:13,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 17:28:13,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:13,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:28:13,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 98 proven. 19 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 17:28:13,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:13,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 18 [2019-11-28 17:28:13,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491991048] [2019-11-28 17:28:13,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:28:13,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:28:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:28:13,207 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand 18 states. [2019-11-28 17:28:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:13,810 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2019-11-28 17:28:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:28:13,810 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-11-28 17:28:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:13,814 INFO L225 Difference]: With dead ends: 118 [2019-11-28 17:28:13,815 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 17:28:13,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:28:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 17:28:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-28 17:28:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 17:28:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-11-28 17:28:13,831 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2019-11-28 17:28:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:13,835 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-28 17:28:13,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:28:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2019-11-28 17:28:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-28 17:28:13,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:13,847 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 14, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:14,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:14,052 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash -554167378, now seen corresponding path program 4 times [2019-11-28 17:28:14,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:14,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084395884] [2019-11-28 17:28:14,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 364 proven. 420 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-11-28 17:28:14,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084395884] [2019-11-28 17:28:14,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676758883] [2019-11-28 17:28:14,873 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:14,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:28:14,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:14,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 17:28:14,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 268 proven. 468 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2019-11-28 17:28:15,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:15,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2019-11-28 17:28:15,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879405430] [2019-11-28 17:28:15,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 17:28:15,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:15,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 17:28:15,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:28:15,265 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 30 states. [2019-11-28 17:28:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:19,455 INFO L93 Difference]: Finished difference Result 183 states and 444 transitions. [2019-11-28 17:28:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-11-28 17:28:19,456 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 157 [2019-11-28 17:28:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:19,460 INFO L225 Difference]: With dead ends: 183 [2019-11-28 17:28:19,461 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 17:28:19,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2752 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1848, Invalid=8658, Unknown=0, NotChecked=0, Total=10506 [2019-11-28 17:28:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 17:28:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2019-11-28 17:28:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 17:28:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2019-11-28 17:28:19,525 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 157 [2019-11-28 17:28:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:19,529 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2019-11-28 17:28:19,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 17:28:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2019-11-28 17:28:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 17:28:19,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:19,535 INFO L410 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] [2019-11-28 17:28:19,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:19,745 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:19,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1646083662, now seen corresponding path program 5 times [2019-11-28 17:28:19,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:19,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976547331] [2019-11-28 17:28:19,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 240 proven. 264 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-11-28 17:28:20,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976547331] [2019-11-28 17:28:20,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442858532] [2019-11-28 17:28:20,181 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:20,251 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 17:28:20,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:20,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 17:28:20,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-28 17:28:20,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:20,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 19 [2019-11-28 17:28:20,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439961273] [2019-11-28 17:28:20,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:28:20,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:28:20,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:28:20,328 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 19 states. [2019-11-28 17:28:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:21,033 INFO L93 Difference]: Finished difference Result 223 states and 395 transitions. [2019-11-28 17:28:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 17:28:21,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-11-28 17:28:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:21,036 INFO L225 Difference]: With dead ends: 223 [2019-11-28 17:28:21,037 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 17:28:21,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 17:28:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 17:28:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-11-28 17:28:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 17:28:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2019-11-28 17:28:21,072 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 130 [2019-11-28 17:28:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:21,076 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2019-11-28 17:28:21,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:28:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2019-11-28 17:28:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 17:28:21,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:21,079 INFO L410 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] [2019-11-28 17:28:21,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:21,293 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash -437561620, now seen corresponding path program 6 times [2019-11-28 17:28:21,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:21,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882843272] [2019-11-28 17:28:21,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-11-28 17:28:21,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882843272] [2019-11-28 17:28:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766116782] [2019-11-28 17:28:21,882 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:21,979 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-11-28 17:28:21,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:21,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 17:28:21,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-11-28 17:28:22,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:22,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-28 17:28:22,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289906563] [2019-11-28 17:28:22,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 17:28:22,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 17:28:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:28:22,095 INFO L87 Difference]: Start difference. First operand 107 states and 163 transitions. Second operand 24 states. [2019-11-28 17:28:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:23,242 INFO L93 Difference]: Finished difference Result 244 states and 432 transitions. [2019-11-28 17:28:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-28 17:28:23,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 156 [2019-11-28 17:28:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:23,248 INFO L225 Difference]: With dead ends: 244 [2019-11-28 17:28:23,249 INFO L226 Difference]: Without dead ends: 145 [2019-11-28 17:28:23,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=543, Invalid=2649, Unknown=0, NotChecked=0, Total=3192 [2019-11-28 17:28:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-28 17:28:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2019-11-28 17:28:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 17:28:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 205 transitions. [2019-11-28 17:28:23,294 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 205 transitions. Word has length 156 [2019-11-28 17:28:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:23,296 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 205 transitions. [2019-11-28 17:28:23,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 17:28:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 205 transitions. [2019-11-28 17:28:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-28 17:28:23,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:23,299 INFO L410 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] [2019-11-28 17:28:23,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:23,506 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1768194034, now seen corresponding path program 7 times [2019-11-28 17:28:23,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:23,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387819978] [2019-11-28 17:28:23,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-11-28 17:28:24,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387819978] [2019-11-28 17:28:24,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761232735] [2019-11-28 17:28:24,198 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-28 17:28:24,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-28 17:28:24,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:24,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-28 17:28:24,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725485397] [2019-11-28 17:28:24,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:28:24,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:28:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:28:24,447 INFO L87 Difference]: Start difference. First operand 127 states and 205 transitions. Second operand 25 states. [2019-11-28 17:28:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:25,578 INFO L93 Difference]: Finished difference Result 288 states and 541 transitions. [2019-11-28 17:28:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-28 17:28:25,580 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 169 [2019-11-28 17:28:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:25,584 INFO L225 Difference]: With dead ends: 288 [2019-11-28 17:28:25,584 INFO L226 Difference]: Without dead ends: 169 [2019-11-28 17:28:25,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=670, Invalid=3236, Unknown=0, NotChecked=0, Total=3906 [2019-11-28 17:28:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-28 17:28:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2019-11-28 17:28:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-28 17:28:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 238 transitions. [2019-11-28 17:28:25,607 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 238 transitions. Word has length 169 [2019-11-28 17:28:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:25,608 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 238 transitions. [2019-11-28 17:28:25,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:28:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 238 transitions. [2019-11-28 17:28:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-28 17:28:25,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:25,611 INFO L410 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] [2019-11-28 17:28:25,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:25,816 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash -728546296, now seen corresponding path program 8 times [2019-11-28 17:28:25,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:25,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211363239] [2019-11-28 17:28:25,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-11-28 17:28:26,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211363239] [2019-11-28 17:28:26,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860042083] [2019-11-28 17:28:26,435 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:26,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:26,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:26,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 17:28:26,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-11-28 17:28:26,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:26,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2019-11-28 17:28:26,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22031097] [2019-11-28 17:28:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 17:28:26,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 17:28:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:28:26,664 INFO L87 Difference]: Start difference. First operand 142 states and 238 transitions. Second operand 26 states. [2019-11-28 17:28:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:27,582 INFO L93 Difference]: Finished difference Result 187 states and 306 transitions. [2019-11-28 17:28:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 17:28:27,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 182 [2019-11-28 17:28:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:27,584 INFO L225 Difference]: With dead ends: 187 [2019-11-28 17:28:27,584 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:28:27,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=527, Invalid=2443, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 17:28:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:28:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:28:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:28:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:28:27,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2019-11-28 17:28:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:27,589 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:28:27,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 17:28:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:28:27,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:28:27,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:27,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:28:28,157 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-11-28 17:28:28,401 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 41 [2019-11-28 17:28:28,523 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-11-28 17:28:28,635 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-11-28 17:28:28,852 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-11-28 17:28:28,966 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-11-28 17:28:29,078 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-11-28 17:28:29,192 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-11-28 17:28:31,334 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 150 DAG size of output: 46 [2019-11-28 17:28:31,448 INFO L246 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-28 17:28:31,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:28:31,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:28:31,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:28:31,449 INFO L246 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-11-28 17:28:31,449 INFO L249 CegarLoopResult]: At program point L25(lines 25 45) the Hoare annotation is: true [2019-11-28 17:28:31,449 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-28 17:28:31,450 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-28 17:28:31,450 INFO L246 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2019-11-28 17:28:31,450 INFO L249 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2019-11-28 17:28:31,450 INFO L246 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-11-28 17:28:31,450 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-28 17:28:31,450 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2019-11-28 17:28:31,450 INFO L242 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (or (not (<= |ackermann_#in~n| 1)) (not (= |ackermann_#in~m| 0))) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2019-11-28 17:28:31,451 INFO L246 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-11-28 17:28:31,451 INFO L242 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2019-11-28 17:28:31,451 INFO L242 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|)) (.cse3 (not (<= 1 |ackermann_#in~m|))) (.cse5 (= |ackermann_#in~m| 0))) (and (let ((.cse1 (<= |ackermann_#in~n| 2)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse2 (<= |ackermann_#in~m| 1))) (or (and .cse0 (<= |ackermann_#in~n| 1)) (and .cse1 .cse2) .cse3 (<= 6 |ackermann_#t~ret1|) (and .cse4 .cse1 (<= |ackermann_#in~m| 2)) (and (<= 4 |ackermann_#t~ret1|) (<= |ackermann_#in~n| 3) .cse2) (and .cse4 (<= |ackermann_#in~n| 4) .cse2))) (= ackermann_~m |ackermann_#in~m|) (or (not (<= |ackermann_#in~m| 0)) .cse5) (= ackermann_~n |ackermann_#in~n|) (or .cse5 (not (<= |ackermann_#in~n| 0))) (or .cse0 .cse3 (= |ackermann_#in~n| 1)) (or .cse5 (<= 2 |ackermann_#t~ret1|)))) [2019-11-28 17:28:31,451 INFO L246 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2019-11-28 17:28:31,451 INFO L246 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-11-28 17:28:31,451 INFO L246 CegarLoopResult]: For program point L21-3(line 21) no Hoare annotation was computed. [2019-11-28 17:28:31,451 INFO L246 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-11-28 17:28:31,452 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-28 17:28:31,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:28:31 BoogieIcfgContainer [2019-11-28 17:28:31,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:28:31,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:28:31,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:28:31,466 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:28:31,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:09" (3/4) ... [2019-11-28 17:28:31,471 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:28:31,480 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-11-28 17:28:31,488 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 17:28:31,489 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:28:31,578 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:28:31,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:28:31,584 INFO L168 Benchmark]: Toolchain (without parser) took 23099.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 460.3 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -78.1 MB). Peak memory consumption was 382.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:31,584 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:31,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:31,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:31,586 INFO L168 Benchmark]: Boogie Preprocessor took 19.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:31,586 INFO L168 Benchmark]: RCFGBuilder took 257.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:31,589 INFO L168 Benchmark]: TraceAbstraction took 22337.07 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.9 MB). Peak memory consumption was 624.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:31,589 INFO L168 Benchmark]: Witness Printer took 113.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:31,597 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22337.07 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.9 MB). Peak memory consumption was 624.0 MB. Max. memory is 11.5 GB. * Witness Printer took 113.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 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 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 18.5s, OverallIterations: 10, TraceHistogramMax: 27, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, HoareTripleCheckerStatistics: 238 SDtfs, 397 SDslu, 1205 SDs, 0 SdLazy, 4717 SolverSat, 1167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1666 GetRequests, 1273 SyntacticMatches, 0 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5422 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 109 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 566 PreInvPairs, 1398 NumberOfFragments, 122 HoareAnnotationTreeSize, 566 FomulaSimplifications, 204196 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4649 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1941 NumberOfCodeBlocks, 1848 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1922 ConstructedInterpolants, 0 QuantifiedInterpolants, 532102 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2584 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 10957/13822 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...