./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/openssl-simplified/s3_srvr_4.cil.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a02d09c3bd79dd383aa53724ac7940e13c97792 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:13:16,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:13:16,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:13:16,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:13:16,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:13:16,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:13:16,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:13:16,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:13:16,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:13:16,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:13:16,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:13:16,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:13:16,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:13:16,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:13:16,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:13:16,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:13:16,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:13:16,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:13:16,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:13:16,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:13:16,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:13:16,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:13:16,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:13:16,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:13:16,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:13:16,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:13:16,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:13:16,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:13:16,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:13:16,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:13:16,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:13:16,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:13:16,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:13:16,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:13:16,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:13:16,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:13:16,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:13:16,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:13:16,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:13:16,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:13:16,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:13:16,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:13:16,322 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:13:16,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:13:16,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:13:16,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:13:16,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:13:16,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:13:16,326 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:13:16,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:13:16,327 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:13:16,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:13:16,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:13:16,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:13:16,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:13:16,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:13:16,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:13:16,328 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:13:16,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:13:16,329 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:13:16,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:13:16,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:13:16,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:13:16,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:13:16,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:16,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:13:16,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:13:16,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:13:16,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:13:16,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:13:16,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:13:16,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:13:16,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 7a02d09c3bd79dd383aa53724ac7940e13c97792 [2021-08-25 20:13:16,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:13:16,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:13:16,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:13:16,811 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:13:16,812 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:13:16,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-08-25 20:13:16,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b497ba9/ffcd3dab0f7e4d2d8e848eca5d8f6e6b/FLAGd32321f09 [2021-08-25 20:13:17,497 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:13:17,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-08-25 20:13:17,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b497ba9/ffcd3dab0f7e4d2d8e848eca5d8f6e6b/FLAGd32321f09 [2021-08-25 20:13:17,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b497ba9/ffcd3dab0f7e4d2d8e848eca5d8f6e6b [2021-08-25 20:13:17,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:13:17,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:13:17,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:17,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:13:17,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:13:17,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:17" (1/1) ... [2021-08-25 20:13:17,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b97c76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:17, skipping insertion in model container [2021-08-25 20:13:17,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:17" (1/1) ... [2021-08-25 20:13:17,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:13:17,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:13:18,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42370,42383] [2021-08-25 20:13:18,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:18,232 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:13:18,311 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42370,42383] [2021-08-25 20:13:18,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:18,340 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:13:18,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18 WrapperNode [2021-08-25 20:13:18,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:18,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:18,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:13:18,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:13:18,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:18,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:13:18,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:13:18,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:13:18,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:13:18,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:13:18,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:13:18,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:13:18,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (1/1) ... [2021-08-25 20:13:18,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:18,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:18,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:13:18,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:13:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:13:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:13:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:13:18,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:13:18,770 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:13:19,340 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:13:19,340 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:13:19,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:13:19,350 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:13:19,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:19 BoogieIcfgContainer [2021-08-25 20:13:19,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:13:19,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:13:19,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:13:19,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:13:19,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:13:17" (1/3) ... [2021-08-25 20:13:19,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4d93a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:19, skipping insertion in model container [2021-08-25 20:13:19,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:18" (2/3) ... [2021-08-25 20:13:19,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4d93a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:19, skipping insertion in model container [2021-08-25 20:13:19,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:19" (3/3) ... [2021-08-25 20:13:19,360 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2021-08-25 20:13:19,364 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:13:19,365 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:13:19,409 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:13:19,415 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:13:19,415 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:13:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:13:19,445 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,445 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:19,446 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-08-25 20:13:19,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708759651] [2021-08-25 20:13:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:19,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708759651] [2021-08-25 20:13:19,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708759651] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106332279] [2021-08-25 20:13:19,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,730 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,970 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-08-25 20:13:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-25 20:13:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,981 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:13:19,981 INFO L226 Difference]: Without dead ends: 175 [2021-08-25 20:13:19,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-25 20:13:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-08-25 20:13:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-08-25 20:13:20,030 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-08-25 20:13:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,032 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-08-25 20:13:20,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-08-25 20:13:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:13:20,035 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,036 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:13:20,036 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-08-25 20:13:20,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433245508] [2021-08-25 20:13:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:20,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433245508] [2021-08-25 20:13:20,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433245508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539123279] [2021-08-25 20:13:20,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,151 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,412 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-08-25 20:13:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:13:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,415 INFO L225 Difference]: With dead ends: 380 [2021-08-25 20:13:20,420 INFO L226 Difference]: Without dead ends: 216 [2021-08-25 20:13:20,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-25 20:13:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-08-25 20:13:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-08-25 20:13:20,443 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-08-25 20:13:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,444 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-08-25 20:13:20,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-08-25 20:13:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:13:20,452 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,452 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:13:20,453 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2021-08-25 20:13:20,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595906103] [2021-08-25 20:13:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:20,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595906103] [2021-08-25 20:13:20,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595906103] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062188038] [2021-08-25 20:13:20,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,566 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,746 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-08-25 20:13:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-25 20:13:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,750 INFO L225 Difference]: With dead ends: 445 [2021-08-25 20:13:20,750 INFO L226 Difference]: Without dead ends: 242 [2021-08-25 20:13:20,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-25 20:13:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-25 20:13:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-08-25 20:13:20,765 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-08-25 20:13:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,766 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-08-25 20:13:20,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-08-25 20:13:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:20,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,767 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:13:20,768 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,769 INFO L82 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2021-08-25 20:13:20,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154680160] [2021-08-25 20:13:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:20,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154680160] [2021-08-25 20:13:20,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154680160] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969959192] [2021-08-25 20:13:20,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,821 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,958 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-08-25 20:13:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:13:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,961 INFO L225 Difference]: With dead ends: 493 [2021-08-25 20:13:20,961 INFO L226 Difference]: Without dead ends: 259 [2021-08-25 20:13:20,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-25 20:13:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-08-25 20:13:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-08-25 20:13:20,974 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-08-25 20:13:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,974 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-08-25 20:13:20,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-08-25 20:13:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:20,976 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,976 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:13:20,976 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2021-08-25 20:13:20,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515168494] [2021-08-25 20:13:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:21,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515168494] [2021-08-25 20:13:21,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515168494] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067142944] [2021-08-25 20:13:21,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,023 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,219 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2021-08-25 20:13:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:13:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,222 INFO L225 Difference]: With dead ends: 553 [2021-08-25 20:13:21,222 INFO L226 Difference]: Without dead ends: 304 [2021-08-25 20:13:21,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-08-25 20:13:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2021-08-25 20:13:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-08-25 20:13:21,236 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-08-25 20:13:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,236 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-08-25 20:13:21,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-08-25 20:13:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:21,238 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,238 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:13:21,238 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2021-08-25 20:13:21,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934030008] [2021-08-25 20:13:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:21,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934030008] [2021-08-25 20:13:21,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934030008] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488541749] [2021-08-25 20:13:21,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,290 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,450 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-08-25 20:13:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-25 20:13:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,453 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:13:21,453 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:13:21,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:13:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-08-25 20:13:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-08-25 20:13:21,463 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-08-25 20:13:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,464 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-08-25 20:13:21,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-08-25 20:13:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:21,465 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,465 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:13:21,466 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2021-08-25 20:13:21,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997589130] [2021-08-25 20:13:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:21,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997589130] [2021-08-25 20:13:21,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997589130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717418959] [2021-08-25 20:13:21,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,506 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,676 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2021-08-25 20:13:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-25 20:13:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,678 INFO L225 Difference]: With dead ends: 595 [2021-08-25 20:13:21,678 INFO L226 Difference]: Without dead ends: 302 [2021-08-25 20:13:21,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-25 20:13:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2021-08-25 20:13:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-08-25 20:13:21,689 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-08-25 20:13:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,690 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-08-25 20:13:21,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-08-25 20:13:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:13:21,691 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,691 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:13:21,692 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2021-08-25 20:13:21,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594086578] [2021-08-25 20:13:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:13:21,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594086578] [2021-08-25 20:13:21,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594086578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228093179] [2021-08-25 20:13:21,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,737 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,023 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-08-25 20:13:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:13:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,025 INFO L225 Difference]: With dead ends: 595 [2021-08-25 20:13:22,025 INFO L226 Difference]: Without dead ends: 306 [2021-08-25 20:13:22,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-25 20:13:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-08-25 20:13:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-08-25 20:13:22,052 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-08-25 20:13:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,053 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-08-25 20:13:22,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-08-25 20:13:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:13:22,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,054 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:13:22,055 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2021-08-25 20:13:22,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258090235] [2021-08-25 20:13:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:22,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258090235] [2021-08-25 20:13:22,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258090235] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970752082] [2021-08-25 20:13:22,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,118 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,260 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-08-25 20:13:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:13:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,264 INFO L225 Difference]: With dead ends: 635 [2021-08-25 20:13:22,264 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:22,268 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-08-25 20:13:22,281 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-08-25 20:13:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,282 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-08-25 20:13:22,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-08-25 20:13:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:13:22,285 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,285 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:13:22,285 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2021-08-25 20:13:22,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073894399] [2021-08-25 20:13:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:22,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073894399] [2021-08-25 20:13:22,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073894399] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244044924] [2021-08-25 20:13:22,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,344 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,482 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-08-25 20:13:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:13:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,485 INFO L225 Difference]: With dead ends: 664 [2021-08-25 20:13:22,485 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:22,486 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-08-25 20:13:22,496 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-08-25 20:13:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,497 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-08-25 20:13:22,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-08-25 20:13:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:13:22,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,499 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:13:22,500 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2021-08-25 20:13:22,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241820952] [2021-08-25 20:13:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:22,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241820952] [2021-08-25 20:13:22,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241820952] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16815010] [2021-08-25 20:13:22,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,547 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,687 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-08-25 20:13:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:13:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,690 INFO L225 Difference]: With dead ends: 697 [2021-08-25 20:13:22,690 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:22,691 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-08-25 20:13:22,702 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-08-25 20:13:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,703 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-08-25 20:13:22,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-08-25 20:13:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:13:22,704 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,704 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:13:22,705 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2021-08-25 20:13:22,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779603640] [2021-08-25 20:13:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:22,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779603640] [2021-08-25 20:13:22,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779603640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467509600] [2021-08-25 20:13:22,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,742 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,890 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-08-25 20:13:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:13:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,893 INFO L225 Difference]: With dead ends: 724 [2021-08-25 20:13:22,893 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:22,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-08-25 20:13:22,904 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-08-25 20:13:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,904 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-08-25 20:13:22,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-08-25 20:13:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:13:22,906 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,906 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:13:22,907 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2021-08-25 20:13:22,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799415525] [2021-08-25 20:13:22,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:22,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799415525] [2021-08-25 20:13:22,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799415525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403670935] [2021-08-25 20:13:22,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,933 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,050 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2021-08-25 20:13:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 20:13:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,052 INFO L225 Difference]: With dead ends: 741 [2021-08-25 20:13:23,052 INFO L226 Difference]: Without dead ends: 387 [2021-08-25 20:13:23,053 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-08-25 20:13:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-08-25 20:13:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-08-25 20:13:23,064 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-08-25 20:13:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,065 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-08-25 20:13:23,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-08-25 20:13:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:13:23,066 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,066 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:13:23,067 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2021-08-25 20:13:23,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733574434] [2021-08-25 20:13:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:23,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733574434] [2021-08-25 20:13:23,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733574434] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681877570] [2021-08-25 20:13:23,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,093 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,225 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2021-08-25 20:13:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:13:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,227 INFO L225 Difference]: With dead ends: 762 [2021-08-25 20:13:23,227 INFO L226 Difference]: Without dead ends: 387 [2021-08-25 20:13:23,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-08-25 20:13:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-08-25 20:13:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-08-25 20:13:23,242 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-08-25 20:13:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,242 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-08-25 20:13:23,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-08-25 20:13:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:13:23,244 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,244 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:13:23,244 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2021-08-25 20:13:23,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681927028] [2021-08-25 20:13:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 20:13:23,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681927028] [2021-08-25 20:13:23,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681927028] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798816968] [2021-08-25 20:13:23,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,278 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,316 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2021-08-25 20:13:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-08-25 20:13:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,320 INFO L225 Difference]: With dead ends: 758 [2021-08-25 20:13:23,320 INFO L226 Difference]: Without dead ends: 756 [2021-08-25 20:13:23,321 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-08-25 20:13:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-08-25 20:13:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5841059602649006) internal successors, (1196), 755 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2021-08-25 20:13:23,345 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2021-08-25 20:13:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,345 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2021-08-25 20:13:23,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2021-08-25 20:13:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:13:23,347 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,347 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:13:23,348 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2021-08-25 20:13:23,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566454998] [2021-08-25 20:13:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:13:23,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566454998] [2021-08-25 20:13:23,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566454998] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532455934] [2021-08-25 20:13:23,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,380 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,425 INFO L93 Difference]: Finished difference Result 1832 states and 2900 transitions. [2021-08-25 20:13:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:13:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,430 INFO L225 Difference]: With dead ends: 1832 [2021-08-25 20:13:23,430 INFO L226 Difference]: Without dead ends: 1084 [2021-08-25 20:13:23,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-08-25 20:13:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2021-08-25 20:13:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5817174515235457) internal successors, (1713), 1083 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1713 transitions. [2021-08-25 20:13:23,473 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1713 transitions. Word has length 122 [2021-08-25 20:13:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,474 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 1713 transitions. [2021-08-25 20:13:23,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1713 transitions. [2021-08-25 20:13:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:13:23,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,477 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:13:23,477 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2021-08-25 20:13:23,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506047672] [2021-08-25 20:13:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:23,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506047672] [2021-08-25 20:13:23,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506047672] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565922188] [2021-08-25 20:13:23,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,506 INFO L87 Difference]: Start difference. First operand 1084 states and 1713 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,561 INFO L93 Difference]: Finished difference Result 2529 states and 4000 transitions. [2021-08-25 20:13:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:13:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,567 INFO L225 Difference]: With dead ends: 2529 [2021-08-25 20:13:23,567 INFO L226 Difference]: Without dead ends: 1453 [2021-08-25 20:13:23,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-08-25 20:13:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2021-08-25 20:13:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.5805785123966942) internal successors, (2295), 1452 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2295 transitions. [2021-08-25 20:13:23,615 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2295 transitions. Word has length 122 [2021-08-25 20:13:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,616 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 2295 transitions. [2021-08-25 20:13:23,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2295 transitions. [2021-08-25 20:13:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:13:23,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,619 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:13:23,619 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2021-08-25 20:13:23,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044118456] [2021-08-25 20:13:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-08-25 20:13:23,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044118456] [2021-08-25 20:13:23,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044118456] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233996649] [2021-08-25 20:13:23,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,646 INFO L87 Difference]: Start difference. First operand 1453 states and 2295 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,714 INFO L93 Difference]: Finished difference Result 3249 states and 5133 transitions. [2021-08-25 20:13:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:13:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,722 INFO L225 Difference]: With dead ends: 3249 [2021-08-25 20:13:23,722 INFO L226 Difference]: Without dead ends: 1804 [2021-08-25 20:13:23,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2021-08-25 20:13:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2021-08-25 20:13:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5784803105934553) internal successors, (2846), 1803 states have internal predecessors, (2846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2846 transitions. [2021-08-25 20:13:23,786 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2846 transitions. Word has length 122 [2021-08-25 20:13:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,787 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2846 transitions. [2021-08-25 20:13:23,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2846 transitions. [2021-08-25 20:13:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-08-25 20:13:23,792 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,792 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:13:23,792 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2021-08-25 20:13:23,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807772525] [2021-08-25 20:13:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-08-25 20:13:23,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807772525] [2021-08-25 20:13:23,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807772525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833724578] [2021-08-25 20:13:23,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,832 INFO L87 Difference]: Start difference. First operand 1804 states and 2846 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:24,039 INFO L93 Difference]: Finished difference Result 3650 states and 5740 transitions. [2021-08-25 20:13:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:24,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2021-08-25 20:13:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:24,047 INFO L225 Difference]: With dead ends: 3650 [2021-08-25 20:13:24,047 INFO L226 Difference]: Without dead ends: 1854 [2021-08-25 20:13:24,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2021-08-25 20:13:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2021-08-25 20:13:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.538546866333888) internal successors, (2774), 1803 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2774 transitions. [2021-08-25 20:13:24,113 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2774 transitions. Word has length 199 [2021-08-25 20:13:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:24,114 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2774 transitions. [2021-08-25 20:13:24,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2774 transitions. [2021-08-25 20:13:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-08-25 20:13:24,119 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:24,119 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:24,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:13:24,119 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2021-08-25 20:13:24,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:24,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301853700] [2021-08-25 20:13:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:24,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-08-25 20:13:24,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:24,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301853700] [2021-08-25 20:13:24,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301853700] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:24,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:24,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:24,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170154829] [2021-08-25 20:13:24,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:24,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:24,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:24,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:24,161 INFO L87 Difference]: Start difference. First operand 1804 states and 2774 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:24,413 INFO L93 Difference]: Finished difference Result 3667 states and 5613 transitions. [2021-08-25 20:13:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2021-08-25 20:13:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:24,422 INFO L225 Difference]: With dead ends: 3667 [2021-08-25 20:13:24,422 INFO L226 Difference]: Without dead ends: 1871 [2021-08-25 20:13:24,425 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-08-25 20:13:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2021-08-25 20:13:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.4963948973932335) internal successors, (2698), 1803 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2698 transitions. [2021-08-25 20:13:24,487 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2698 transitions. Word has length 213 [2021-08-25 20:13:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:24,487 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2698 transitions. [2021-08-25 20:13:24,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2698 transitions. [2021-08-25 20:13:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-08-25 20:13:24,494 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:24,494 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:24,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:13:24,494 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2021-08-25 20:13:24,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:24,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716194944] [2021-08-25 20:13:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:24,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-25 20:13:24,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:24,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716194944] [2021-08-25 20:13:24,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716194944] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:24,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276198679] [2021-08-25 20:13:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:24,562 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:24,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:24,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:24,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:13:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:24,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:24,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-25 20:13:25,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276198679] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:25,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:25,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:25,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044376289] [2021-08-25 20:13:25,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:25,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:25,511 INFO L87 Difference]: Start difference. First operand 1804 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:25,866 INFO L93 Difference]: Finished difference Result 4265 states and 6329 transitions. [2021-08-25 20:13:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:25,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-08-25 20:13:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:25,876 INFO L225 Difference]: With dead ends: 4265 [2021-08-25 20:13:25,877 INFO L226 Difference]: Without dead ends: 2436 [2021-08-25 20:13:25,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-08-25 20:13:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2021-08-25 20:13:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.4734872114784778) internal successors, (2362), 1603 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2362 transitions. [2021-08-25 20:13:25,941 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2362 transitions. Word has length 232 [2021-08-25 20:13:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:25,942 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2362 transitions. [2021-08-25 20:13:25,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2362 transitions. [2021-08-25 20:13:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-08-25 20:13:25,946 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:25,947 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:25,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:26,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-25 20:13:26,161 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2021-08-25 20:13:26,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:26,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231335242] [2021-08-25 20:13:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:26,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2021-08-25 20:13:26,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:26,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231335242] [2021-08-25 20:13:26,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231335242] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:26,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:26,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:26,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76597700] [2021-08-25 20:13:26,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:26,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:26,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:26,211 INFO L87 Difference]: Start difference. First operand 1604 states and 2362 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:26,431 INFO L93 Difference]: Finished difference Result 3395 states and 5017 transitions. [2021-08-25 20:13:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:26,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2021-08-25 20:13:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:26,438 INFO L225 Difference]: With dead ends: 3395 [2021-08-25 20:13:26,438 INFO L226 Difference]: Without dead ends: 1679 [2021-08-25 20:13:26,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2021-08-25 20:13:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2021-08-25 20:13:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.4463647199046483) internal successors, (2427), 1678 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2427 transitions. [2021-08-25 20:13:26,512 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2427 transitions. Word has length 241 [2021-08-25 20:13:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:26,513 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 2427 transitions. [2021-08-25 20:13:26,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2427 transitions. [2021-08-25 20:13:26,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-08-25 20:13:26,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:26,518 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:26,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:13:26,519 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:26,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2021-08-25 20:13:26,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:26,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885027043] [2021-08-25 20:13:26,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:26,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-08-25 20:13:26,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:26,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885027043] [2021-08-25 20:13:26,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885027043] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:26,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836558551] [2021-08-25 20:13:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:26,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:26,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:26,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 20:13:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:26,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:26,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-08-25 20:13:27,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836558551] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:27,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:27,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:27,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712505229] [2021-08-25 20:13:27,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:27,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:27,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:27,574 INFO L87 Difference]: Start difference. First operand 1679 states and 2427 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:27,949 INFO L93 Difference]: Finished difference Result 5320 states and 7733 transitions. [2021-08-25 20:13:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2021-08-25 20:13:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:27,965 INFO L225 Difference]: With dead ends: 5320 [2021-08-25 20:13:27,965 INFO L226 Difference]: Without dead ends: 3649 [2021-08-25 20:13:27,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2021-08-25 20:13:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2004. [2021-08-25 20:13:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 2003 states have (on average 1.36245631552671) internal successors, (2729), 2003 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2729 transitions. [2021-08-25 20:13:28,047 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2729 transitions. Word has length 253 [2021-08-25 20:13:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:28,047 INFO L470 AbstractCegarLoop]: Abstraction has 2004 states and 2729 transitions. [2021-08-25 20:13:28,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2729 transitions. [2021-08-25 20:13:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-08-25 20:13:28,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:28,054 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:28,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:28,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-25 20:13:28,273 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2021-08-25 20:13:28,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:28,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677004270] [2021-08-25 20:13:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:28,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:13:28,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:28,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677004270] [2021-08-25 20:13:28,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677004270] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:28,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:28,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:28,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052605250] [2021-08-25 20:13:28,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:28,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:28,407 INFO L87 Difference]: Start difference. First operand 2004 states and 2729 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:28,538 INFO L93 Difference]: Finished difference Result 5742 states and 7864 transitions. [2021-08-25 20:13:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2021-08-25 20:13:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:28,552 INFO L225 Difference]: With dead ends: 5742 [2021-08-25 20:13:28,554 INFO L226 Difference]: Without dead ends: 3746 [2021-08-25 20:13:28,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2021-08-25 20:13:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2021-08-25 20:13:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 1.371627037135987) internal successors, (5134), 3743 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5134 transitions. [2021-08-25 20:13:28,675 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5134 transitions. Word has length 253 [2021-08-25 20:13:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:28,676 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 5134 transitions. [2021-08-25 20:13:28,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5134 transitions. [2021-08-25 20:13:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-08-25 20:13:28,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:28,684 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:28,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:13:28,684 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2021-08-25 20:13:28,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:28,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249015910] [2021-08-25 20:13:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:28,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-08-25 20:13:28,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:28,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249015910] [2021-08-25 20:13:28,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249015910] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:28,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:28,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:28,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492381846] [2021-08-25 20:13:28,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:28,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:28,729 INFO L87 Difference]: Start difference. First operand 3744 states and 5134 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:28,974 INFO L93 Difference]: Finished difference Result 7698 states and 10554 transitions. [2021-08-25 20:13:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2021-08-25 20:13:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:29,005 INFO L225 Difference]: With dead ends: 7698 [2021-08-25 20:13:29,006 INFO L226 Difference]: Without dead ends: 3962 [2021-08-25 20:13:29,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2021-08-25 20:13:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3744. [2021-08-25 20:13:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 1.3438418380977826) internal successors, (5030), 3743 states have internal predecessors, (5030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5030 transitions. [2021-08-25 20:13:29,166 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5030 transitions. Word has length 256 [2021-08-25 20:13:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:29,166 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 5030 transitions. [2021-08-25 20:13:29,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5030 transitions. [2021-08-25 20:13:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-08-25 20:13:29,175 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:29,176 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:29,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:13:29,176 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:29,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2021-08-25 20:13:29,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:29,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376985769] [2021-08-25 20:13:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:29,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-08-25 20:13:29,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:29,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376985769] [2021-08-25 20:13:29,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376985769] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:29,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:29,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:29,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823486677] [2021-08-25 20:13:29,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:29,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:29,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,218 INFO L87 Difference]: Start difference. First operand 3744 states and 5030 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:29,392 INFO L93 Difference]: Finished difference Result 7612 states and 10230 transitions. [2021-08-25 20:13:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2021-08-25 20:13:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:29,402 INFO L225 Difference]: With dead ends: 7612 [2021-08-25 20:13:29,402 INFO L226 Difference]: Without dead ends: 3876 [2021-08-25 20:13:29,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2021-08-25 20:13:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3836. [2021-08-25 20:13:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 1.3408083441981746) internal successors, (5142), 3835 states have internal predecessors, (5142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5142 transitions. [2021-08-25 20:13:29,546 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5142 transitions. Word has length 290 [2021-08-25 20:13:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:29,546 INFO L470 AbstractCegarLoop]: Abstraction has 3836 states and 5142 transitions. [2021-08-25 20:13:29,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5142 transitions. [2021-08-25 20:13:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-08-25 20:13:29,555 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:29,555 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:29,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:13:29,555 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2021-08-25 20:13:29,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:29,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47271722] [2021-08-25 20:13:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:29,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-08-25 20:13:29,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:29,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47271722] [2021-08-25 20:13:29,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47271722] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:29,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:29,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:29,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834643652] [2021-08-25 20:13:29,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:29,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,597 INFO L87 Difference]: Start difference. First operand 3836 states and 5142 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:29,785 INFO L93 Difference]: Finished difference Result 8044 states and 10852 transitions. [2021-08-25 20:13:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2021-08-25 20:13:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:29,794 INFO L225 Difference]: With dead ends: 8044 [2021-08-25 20:13:29,795 INFO L226 Difference]: Without dead ends: 4216 [2021-08-25 20:13:29,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2021-08-25 20:13:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4086. [2021-08-25 20:13:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4085 states have (on average 1.3321909424724603) internal successors, (5442), 4085 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5442 transitions. [2021-08-25 20:13:29,942 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5442 transitions. Word has length 311 [2021-08-25 20:13:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:29,943 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 5442 transitions. [2021-08-25 20:13:29,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5442 transitions. [2021-08-25 20:13:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-08-25 20:13:29,952 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:29,953 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:29,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:13:29,953 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2021-08-25 20:13:29,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:29,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092221906] [2021-08-25 20:13:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:29,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2021-08-25 20:13:29,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:29,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092221906] [2021-08-25 20:13:29,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092221906] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:29,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:29,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:29,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765526370] [2021-08-25 20:13:29,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:29,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:30,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:30,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:30,000 INFO L87 Difference]: Start difference. First operand 4086 states and 5442 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:30,148 INFO L93 Difference]: Finished difference Result 6855 states and 9019 transitions. [2021-08-25 20:13:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2021-08-25 20:13:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:30,153 INFO L225 Difference]: With dead ends: 6855 [2021-08-25 20:13:30,153 INFO L226 Difference]: Without dead ends: 2133 [2021-08-25 20:13:30,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2021-08-25 20:13:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2133. [2021-08-25 20:13:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.301125703564728) internal successors, (2774), 2132 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2774 transitions. [2021-08-25 20:13:30,214 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2774 transitions. Word has length 321 [2021-08-25 20:13:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:30,215 INFO L470 AbstractCegarLoop]: Abstraction has 2133 states and 2774 transitions. [2021-08-25 20:13:30,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2774 transitions. [2021-08-25 20:13:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2021-08-25 20:13:30,222 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:30,222 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:30,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:13:30,222 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2021-08-25 20:13:30,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:30,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556064869] [2021-08-25 20:13:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:30,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-08-25 20:13:30,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:30,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556064869] [2021-08-25 20:13:30,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556064869] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:30,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:30,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:30,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130032313] [2021-08-25 20:13:30,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:30,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:30,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:30,271 INFO L87 Difference]: Start difference. First operand 2133 states and 2774 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:30,434 INFO L93 Difference]: Finished difference Result 4298 states and 5601 transitions. [2021-08-25 20:13:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2021-08-25 20:13:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:30,438 INFO L225 Difference]: With dead ends: 4298 [2021-08-25 20:13:30,439 INFO L226 Difference]: Without dead ends: 2173 [2021-08-25 20:13:30,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2021-08-25 20:13:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2133. [2021-08-25 20:13:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.2823639774859288) internal successors, (2734), 2132 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2734 transitions. [2021-08-25 20:13:30,493 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2734 transitions. Word has length 337 [2021-08-25 20:13:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:30,493 INFO L470 AbstractCegarLoop]: Abstraction has 2133 states and 2734 transitions. [2021-08-25 20:13:30,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2734 transitions. [2021-08-25 20:13:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-08-25 20:13:30,498 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:30,498 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:30,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:13:30,499 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:30,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2021-08-25 20:13:30,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:30,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384596652] [2021-08-25 20:13:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:30,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-08-25 20:13:30,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:30,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384596652] [2021-08-25 20:13:30,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384596652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:30,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:30,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:30,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608414779] [2021-08-25 20:13:30,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:30,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:30,550 INFO L87 Difference]: Start difference. First operand 2133 states and 2734 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:30,694 INFO L93 Difference]: Finished difference Result 4268 states and 5466 transitions. [2021-08-25 20:13:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:30,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2021-08-25 20:13:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:30,699 INFO L225 Difference]: With dead ends: 4268 [2021-08-25 20:13:30,700 INFO L226 Difference]: Without dead ends: 2143 [2021-08-25 20:13:30,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2021-08-25 20:13:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2133. [2021-08-25 20:13:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.2636022514071295) internal successors, (2694), 2132 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2694 transitions. [2021-08-25 20:13:30,753 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2694 transitions. Word has length 360 [2021-08-25 20:13:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:30,754 INFO L470 AbstractCegarLoop]: Abstraction has 2133 states and 2694 transitions. [2021-08-25 20:13:30,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2694 transitions. [2021-08-25 20:13:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-08-25 20:13:30,759 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:30,759 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:30,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:13:30,760 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2021-08-25 20:13:30,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:30,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447607747] [2021-08-25 20:13:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:30,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-08-25 20:13:30,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:30,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447607747] [2021-08-25 20:13:30,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447607747] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:30,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726062398] [2021-08-25 20:13:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:30,837 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:30,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:30,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:30,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 20:13:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:31,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:31,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2021-08-25 20:13:32,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726062398] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:32,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:32,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:32,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458923766] [2021-08-25 20:13:32,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:32,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:32,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:32,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:32,517 INFO L87 Difference]: Start difference. First operand 2133 states and 2694 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:32,632 INFO L93 Difference]: Finished difference Result 2711 states and 3448 transitions. [2021-08-25 20:13:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2021-08-25 20:13:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:32,638 INFO L225 Difference]: With dead ends: 2711 [2021-08-25 20:13:32,638 INFO L226 Difference]: Without dead ends: 2573 [2021-08-25 20:13:32,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2021-08-25 20:13:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1997. [2021-08-25 20:13:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1996 states have (on average 1.2725450901803608) internal successors, (2540), 1996 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2540 transitions. [2021-08-25 20:13:32,744 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2540 transitions. Word has length 393 [2021-08-25 20:13:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:32,745 INFO L470 AbstractCegarLoop]: Abstraction has 1997 states and 2540 transitions. [2021-08-25 20:13:32,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2540 transitions. [2021-08-25 20:13:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2021-08-25 20:13:32,750 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:32,750 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:32,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:32,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:32,951 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2021-08-25 20:13:32,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:32,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640263792] [2021-08-25 20:13:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:32,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-08-25 20:13:33,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:33,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640263792] [2021-08-25 20:13:33,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640263792] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:33,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771647298] [2021-08-25 20:13:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:33,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:33,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:33,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:33,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 20:13:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:33,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:33,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-08-25 20:13:34,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771647298] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:34,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:34,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:34,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893333769] [2021-08-25 20:13:34,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:34,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:34,614 INFO L87 Difference]: Start difference. First operand 1997 states and 2540 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:34,917 INFO L93 Difference]: Finished difference Result 5016 states and 6404 transitions. [2021-08-25 20:13:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2021-08-25 20:13:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:34,923 INFO L225 Difference]: With dead ends: 5016 [2021-08-25 20:13:34,923 INFO L226 Difference]: Without dead ends: 2985 [2021-08-25 20:13:34,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2021-08-25 20:13:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2157. [2021-08-25 20:13:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2156 states have (on average 1.280148423005566) internal successors, (2760), 2156 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2760 transitions. [2021-08-25 20:13:34,988 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2760 transitions. Word has length 409 [2021-08-25 20:13:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:34,988 INFO L470 AbstractCegarLoop]: Abstraction has 2157 states and 2760 transitions. [2021-08-25 20:13:34,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2760 transitions. [2021-08-25 20:13:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2021-08-25 20:13:34,994 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:34,994 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:35,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:35,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:35,209 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1865506571, now seen corresponding path program 1 times [2021-08-25 20:13:35,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:35,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020040229] [2021-08-25 20:13:35,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:35,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2021-08-25 20:13:35,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:35,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020040229] [2021-08-25 20:13:35,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020040229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:35,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:35,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:35,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658625630] [2021-08-25 20:13:35,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:35,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:35,536 INFO L87 Difference]: Start difference. First operand 2157 states and 2760 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:35,792 INFO L93 Difference]: Finished difference Result 4486 states and 5763 transitions. [2021-08-25 20:13:35,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:35,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 471 [2021-08-25 20:13:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:35,797 INFO L225 Difference]: With dead ends: 4486 [2021-08-25 20:13:35,797 INFO L226 Difference]: Without dead ends: 2337 [2021-08-25 20:13:35,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 96.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2021-08-25 20:13:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2327. [2021-08-25 20:13:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2326 states have (on average 1.2704213241616509) internal successors, (2955), 2326 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2955 transitions. [2021-08-25 20:13:35,854 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2955 transitions. Word has length 471 [2021-08-25 20:13:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:35,855 INFO L470 AbstractCegarLoop]: Abstraction has 2327 states and 2955 transitions. [2021-08-25 20:13:35,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2955 transitions. [2021-08-25 20:13:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2021-08-25 20:13:35,860 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:35,861 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:35,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:13:35,861 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1625661125, now seen corresponding path program 1 times [2021-08-25 20:13:35,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:35,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776838706] [2021-08-25 20:13:35,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:35,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2021-08-25 20:13:35,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:35,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776838706] [2021-08-25 20:13:35,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776838706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:35,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:35,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:35,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852288660] [2021-08-25 20:13:35,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:35,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:35,942 INFO L87 Difference]: Start difference. First operand 2327 states and 2955 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:36,090 INFO L93 Difference]: Finished difference Result 4641 states and 5888 transitions. [2021-08-25 20:13:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 533 [2021-08-25 20:13:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:36,095 INFO L225 Difference]: With dead ends: 4641 [2021-08-25 20:13:36,095 INFO L226 Difference]: Without dead ends: 2322 [2021-08-25 20:13:36,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2021-08-25 20:13:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2021-08-25 20:13:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2321 states have (on average 1.2429987074536837) internal successors, (2885), 2321 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2885 transitions. [2021-08-25 20:13:36,149 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2885 transitions. Word has length 533 [2021-08-25 20:13:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:36,150 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 2885 transitions. [2021-08-25 20:13:36,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2885 transitions. [2021-08-25 20:13:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2021-08-25 20:13:36,156 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:36,156 INFO L512 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:36,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:13:36,157 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2021-08-25 20:13:36,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:36,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013988211] [2021-08-25 20:13:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:36,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-08-25 20:13:36,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:36,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013988211] [2021-08-25 20:13:36,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013988211] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:36,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085560795] [2021-08-25 20:13:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:36,252 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:36,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:36,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:13:36,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 20:13:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:36,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:36,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-08-25 20:13:38,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085560795] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:38,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:38,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:38,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77878901] [2021-08-25 20:13:38,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:38,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:38,514 INFO L87 Difference]: Start difference. First operand 2322 states and 2885 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:38,744 INFO L93 Difference]: Finished difference Result 3917 states and 4895 transitions. [2021-08-25 20:13:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:13:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 599 [2021-08-25 20:13:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:38,746 INFO L225 Difference]: With dead ends: 3917 [2021-08-25 20:13:38,746 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:13:38,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:13:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:13:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:13:38,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2021-08-25 20:13:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:38,750 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:13:38,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:13:38,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:13:38,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:13:38,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:38,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-08-25 20:13:38,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:13:38,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:38,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:39,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:40,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:41,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:50,114 INFO L857 garLoopResultBuilder]: For program point L531(lines 531 537) no Hoare annotation was computed. [2021-08-25 20:13:50,114 INFO L857 garLoopResultBuilder]: For program point L531-1(lines 531 537) no Hoare annotation was computed. [2021-08-25 20:13:50,114 INFO L857 garLoopResultBuilder]: For program point L334(lines 334 368) no Hoare annotation was computed. [2021-08-25 20:13:50,114 INFO L857 garLoopResultBuilder]: For program point L334-1(lines 334 368) no Hoare annotation was computed. [2021-08-25 20:13:50,114 INFO L857 garLoopResultBuilder]: For program point L202(lines 202 547) no Hoare annotation was computed. [2021-08-25 20:13:50,114 INFO L857 garLoopResultBuilder]: For program point L169(lines 169 558) no Hoare annotation was computed. [2021-08-25 20:13:50,115 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 569) no Hoare annotation was computed. [2021-08-25 20:13:50,115 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 580) no Hoare annotation was computed. [2021-08-25 20:13:50,115 INFO L857 garLoopResultBuilder]: For program point L467(lines 467 469) no Hoare annotation was computed. [2021-08-25 20:13:50,115 INFO L857 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2021-08-25 20:13:50,115 INFO L857 garLoopResultBuilder]: For program point L335(lines 335 365) no Hoare annotation was computed. [2021-08-25 20:13:50,115 INFO L853 garLoopResultBuilder]: At program point L203(lines 199 548) the Hoare annotation is: (let ((.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1) (and .cse0 .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse2 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-08-25 20:13:50,116 INFO L853 garLoopResultBuilder]: At program point L104(lines 103 580) the Hoare annotation is: false [2021-08-25 20:13:50,116 INFO L860 garLoopResultBuilder]: At program point L600(lines 99 601) the Hoare annotation is: true [2021-08-25 20:13:50,116 INFO L857 garLoopResultBuilder]: For program point L534(lines 534 536) no Hoare annotation was computed. [2021-08-25 20:13:50,116 INFO L857 garLoopResultBuilder]: For program point L205(lines 205 546) no Hoare annotation was computed. [2021-08-25 20:13:50,116 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 557) no Hoare annotation was computed. [2021-08-25 20:13:50,116 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 568) no Hoare annotation was computed. [2021-08-25 20:13:50,116 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 579) no Hoare annotation was computed. [2021-08-25 20:13:50,117 INFO L857 garLoopResultBuilder]: For program point L305(lines 305 312) no Hoare annotation was computed. [2021-08-25 20:13:50,117 INFO L857 garLoopResultBuilder]: For program point L305-2(lines 305 312) no Hoare annotation was computed. [2021-08-25 20:13:50,117 INFO L853 garLoopResultBuilder]: At program point L206(lines 205 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:50,117 INFO L853 garLoopResultBuilder]: At program point L173(lines 169 558) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-08-25 20:13:50,117 INFO L853 garLoopResultBuilder]: At program point L140(lines 136 569) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-08-25 20:13:50,117 INFO L857 garLoopResultBuilder]: For program point L340(lines 340 363) no Hoare annotation was computed. [2021-08-25 20:13:50,117 INFO L853 garLoopResultBuilder]: At program point L208(lines 207 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:50,117 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 556) no Hoare annotation was computed. [2021-08-25 20:13:50,117 INFO L857 garLoopResultBuilder]: For program point L142(lines 142 567) no Hoare annotation was computed. [2021-08-25 20:13:50,117 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 578) no Hoare annotation was computed. [2021-08-25 20:13:50,118 INFO L857 garLoopResultBuilder]: For program point L605(lines 605 607) no Hoare annotation was computed. [2021-08-25 20:13:50,118 INFO L857 garLoopResultBuilder]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2021-08-25 20:13:50,118 INFO L857 garLoopResultBuilder]: For program point L506(lines 506 509) no Hoare annotation was computed. [2021-08-25 20:13:50,118 INFO L857 garLoopResultBuilder]: For program point L275(lines 275 277) no Hoare annotation was computed. [2021-08-25 20:13:50,118 INFO L857 garLoopResultBuilder]: For program point L275-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:50,118 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 443) no Hoare annotation was computed. [2021-08-25 20:13:50,118 INFO L857 garLoopResultBuilder]: For program point L309(lines 309 311) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L343-2(lines 343 347) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 254) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 555) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L145(lines 145 566) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 577) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L476(lines 476 478) no Hoare annotation was computed. [2021-08-25 20:13:50,119 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 409) no Hoare annotation was computed. [2021-08-25 20:13:50,120 INFO L857 garLoopResultBuilder]: For program point L245(lines 245 248) no Hoare annotation was computed. [2021-08-25 20:13:50,120 INFO L853 garLoopResultBuilder]: At program point L212(lines 106 579) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2) (and (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2021-08-25 20:13:50,120 INFO L853 garLoopResultBuilder]: At program point L179(lines 175 556) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-08-25 20:13:50,120 INFO L853 garLoopResultBuilder]: At program point L146(lines 142 567) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-08-25 20:13:50,120 INFO L857 garLoopResultBuilder]: For program point L444(lines 444 453) no Hoare annotation was computed. [2021-08-25 20:13:50,121 INFO L857 garLoopResultBuilder]: For program point L378(lines 378 384) no Hoare annotation was computed. [2021-08-25 20:13:50,121 INFO L860 garLoopResultBuilder]: At program point L610(lines 12 612) the Hoare annotation is: true [2021-08-25 20:13:50,121 INFO L853 garLoopResultBuilder]: At program point L544(lines 100 599) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse29 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not .cse27)) (.cse12 (not .cse29)) (.cse4 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse22 (not .cse10)) (.cse14 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse1 .cse18) (and .cse19 .cse20) (and .cse11 .cse21 .cse22 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse24 .cse18 .cse19) (and .cse21 .cse20) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse17 .cse25 .cse26) (and .cse4 .cse5 .cse24 .cse6 .cse7 .cse9 .cse0 .cse13 .cse15 .cse25) (and .cse27 .cse10 .cse14) (and .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse28 .cse19) (and .cse10 .cse14 .cse29) (and .cse24 .cse10 .cse18 .cse14) (and .cse1 .cse2 .cse3 .cse18 .cse14) (and .cse0 .cse20) (and .cse0 .cse23) (and .cse4 .cse5 .cse24 .cse7 .cse9 .cse13 .cse15 .cse25 .cse19) (and .cse1 .cse2 .cse22 .cse3 .cse14) (and .cse10 .cse1 .cse2 .cse3 .cse19) (and .cse11 .cse3 .cse19) (and .cse24 .cse0 .cse18) (and .cse23 .cse19) (and .cse21 .cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25 .cse26) (and .cse28 .cse0) (and .cse16 .cse17 .cse1 .cse22) (and .cse14 .cse20)))) [2021-08-25 20:13:50,121 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 554) no Hoare annotation was computed. [2021-08-25 20:13:50,121 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 565) no Hoare annotation was computed. [2021-08-25 20:13:50,122 INFO L857 garLoopResultBuilder]: For program point L115(lines 115 576) no Hoare annotation was computed. [2021-08-25 20:13:50,122 INFO L857 garLoopResultBuilder]: For program point L479(lines 479 483) no Hoare annotation was computed. [2021-08-25 20:13:50,122 INFO L857 garLoopResultBuilder]: For program point L479-2(lines 479 483) no Hoare annotation was computed. [2021-08-25 20:13:50,122 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:50,122 INFO L857 garLoopResultBuilder]: For program point L514(lines 514 516) no Hoare annotation was computed. [2021-08-25 20:13:50,122 INFO L857 garLoopResultBuilder]: For program point L448(lines 448 450) no Hoare annotation was computed. [2021-08-25 20:13:50,122 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:50,123 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 553) no Hoare annotation was computed. [2021-08-25 20:13:50,123 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 564) no Hoare annotation was computed. [2021-08-25 20:13:50,123 INFO L857 garLoopResultBuilder]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:50,123 INFO L857 garLoopResultBuilder]: For program point L118(lines 118 575) no Hoare annotation was computed. [2021-08-25 20:13:50,123 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 597) no Hoare annotation was computed. [2021-08-25 20:13:50,123 INFO L853 garLoopResultBuilder]: At program point L515(lines 73 611) the Hoare annotation is: false [2021-08-25 20:13:50,123 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:13:50,124 INFO L853 garLoopResultBuilder]: At program point L185(lines 181 554) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:13:50,124 INFO L853 garLoopResultBuilder]: At program point L152(lines 148 565) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-08-25 20:13:50,124 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 88) no Hoare annotation was computed. [2021-08-25 20:13:50,124 INFO L857 garLoopResultBuilder]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:50,124 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 596) no Hoare annotation was computed. [2021-08-25 20:13:50,124 INFO L857 garLoopResultBuilder]: For program point L351(lines 351 359) no Hoare annotation was computed. [2021-08-25 20:13:50,125 INFO L857 garLoopResultBuilder]: For program point L583(lines 583 588) no Hoare annotation was computed. [2021-08-25 20:13:50,125 INFO L857 garLoopResultBuilder]: For program point L517(lines 517 519) no Hoare annotation was computed. [2021-08-25 20:13:50,125 INFO L857 garLoopResultBuilder]: For program point L583-2(lines 582 596) no Hoare annotation was computed. [2021-08-25 20:13:50,125 INFO L853 garLoopResultBuilder]: At program point L352(lines 328 370) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-08-25 20:13:50,125 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 552) no Hoare annotation was computed. [2021-08-25 20:13:50,125 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 563) no Hoare annotation was computed. [2021-08-25 20:13:50,126 INFO L857 garLoopResultBuilder]: For program point L121(lines 121 574) no Hoare annotation was computed. [2021-08-25 20:13:50,126 INFO L857 garLoopResultBuilder]: For program point L419(lines 419 421) no Hoare annotation was computed. [2021-08-25 20:13:50,126 INFO L853 garLoopResultBuilder]: At program point L386(lines 377 409) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-08-25 20:13:50,126 INFO L853 garLoopResultBuilder]: At program point L122(lines 118 575) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-08-25 20:13:50,126 INFO L857 garLoopResultBuilder]: For program point L585(lines 585 587) no Hoare annotation was computed. [2021-08-25 20:13:50,126 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 356) no Hoare annotation was computed. [2021-08-25 20:13:50,126 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 290) no Hoare annotation was computed. [2021-08-25 20:13:50,127 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-08-25 20:13:50,127 INFO L857 garLoopResultBuilder]: For program point L288-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:50,127 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2021-08-25 20:13:50,127 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:13:50,127 INFO L857 garLoopResultBuilder]: For program point L322-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:50,127 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 551) no Hoare annotation was computed. [2021-08-25 20:13:50,127 INFO L857 garLoopResultBuilder]: For program point L157(lines 157 562) no Hoare annotation was computed. [2021-08-25 20:13:50,128 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 573) no Hoare annotation was computed. [2021-08-25 20:13:50,128 INFO L857 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-08-25 20:13:50,128 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 73 611) no Hoare annotation was computed. [2021-08-25 20:13:50,128 INFO L857 garLoopResultBuilder]: For program point L521(lines 521 525) no Hoare annotation was computed. [2021-08-25 20:13:50,128 INFO L857 garLoopResultBuilder]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2021-08-25 20:13:50,128 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 407) no Hoare annotation was computed. [2021-08-25 20:13:50,128 INFO L853 garLoopResultBuilder]: At program point L191(lines 187 552) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4))) [2021-08-25 20:13:50,129 INFO L853 garLoopResultBuilder]: At program point L158(lines 154 563) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-08-25 20:13:50,129 INFO L853 garLoopResultBuilder]: At program point L125(lines 124 573) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-08-25 20:13:50,129 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 94) no Hoare annotation was computed. [2021-08-25 20:13:50,129 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 492) no Hoare annotation was computed. [2021-08-25 20:13:50,129 INFO L857 garLoopResultBuilder]: For program point L390(lines 390 396) no Hoare annotation was computed. [2021-08-25 20:13:50,129 INFO L860 garLoopResultBuilder]: At program point L622(lines 613 624) the Hoare annotation is: true [2021-08-25 20:13:50,130 INFO L857 garLoopResultBuilder]: For program point L193(lines 193 550) no Hoare annotation was computed. [2021-08-25 20:13:50,130 INFO L857 garLoopResultBuilder]: For program point L160(lines 160 561) no Hoare annotation was computed. [2021-08-25 20:13:50,130 INFO L857 garLoopResultBuilder]: For program point L127(lines 127 572) no Hoare annotation was computed. [2021-08-25 20:13:50,130 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:13:50,130 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-08-25 20:13:50,130 INFO L857 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-08-25 20:13:50,130 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 262) no Hoare annotation was computed. [2021-08-25 20:13:50,131 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 238) no Hoare annotation was computed. [2021-08-25 20:13:50,131 INFO L857 garLoopResultBuilder]: For program point L227-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:50,131 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:13:50,131 INFO L857 garLoopResultBuilder]: For program point L294-2(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:13:50,131 INFO L857 garLoopResultBuilder]: For program point L427-1(lines 427 435) no Hoare annotation was computed. [2021-08-25 20:13:50,131 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 232) no Hoare annotation was computed. [2021-08-25 20:13:50,131 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 549) no Hoare annotation was computed. [2021-08-25 20:13:50,132 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 560) no Hoare annotation was computed. [2021-08-25 20:13:50,132 INFO L857 garLoopResultBuilder]: For program point L130(lines 130 571) no Hoare annotation was computed. [2021-08-25 20:13:50,132 INFO L857 garLoopResultBuilder]: For program point L494(lines 494 500) no Hoare annotation was computed. [2021-08-25 20:13:50,132 INFO L853 garLoopResultBuilder]: At program point L197(lines 193 550) the Hoare annotation is: (let ((.cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse3) (and .cse0 .cse1 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4) (and .cse0 .cse2 .cse1 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-08-25 20:13:50,132 INFO L853 garLoopResultBuilder]: At program point L164(lines 160 561) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-08-25 20:13:50,132 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:13:50,133 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2021-08-25 20:13:50,133 INFO L857 garLoopResultBuilder]: For program point L430(lines 430 433) no Hoare annotation was computed. [2021-08-25 20:13:50,133 INFO L857 garLoopResultBuilder]: For program point L331(lines 331 369) no Hoare annotation was computed. [2021-08-25 20:13:50,133 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 548) no Hoare annotation was computed. [2021-08-25 20:13:50,133 INFO L857 garLoopResultBuilder]: For program point L166(lines 166 559) no Hoare annotation was computed. [2021-08-25 20:13:50,133 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 570) no Hoare annotation was computed. [2021-08-25 20:13:50,134 INFO L853 garLoopResultBuilder]: At program point L100-2(lines 100 599) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse29 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not .cse27)) (.cse12 (not .cse29)) (.cse4 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse22 (not .cse10)) (.cse14 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse1 .cse18) (and .cse19 .cse20) (and .cse11 .cse21 .cse22 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse24 .cse18 .cse19) (and .cse21 .cse20) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse17 .cse25 .cse26) (and .cse4 .cse5 .cse24 .cse6 .cse7 .cse9 .cse0 .cse13 .cse15 .cse25) (and .cse27 .cse10 .cse14) (and .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse28 .cse19) (and .cse10 .cse14 .cse29) (and .cse24 .cse10 .cse18 .cse14) (and .cse1 .cse2 .cse3 .cse18 .cse14) (and .cse0 .cse20) (and .cse0 .cse23) (and .cse4 .cse5 .cse24 .cse7 .cse9 .cse13 .cse15 .cse25 .cse19) (and .cse1 .cse2 .cse22 .cse3 .cse14) (and .cse10 .cse1 .cse2 .cse3 .cse19) (and .cse11 .cse3 .cse19) (and .cse24 .cse0 .cse18) (and .cse23 .cse19) (and .cse21 .cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25 .cse26) (and .cse28 .cse0) (and .cse16 .cse17 .cse1 .cse22) (and .cse14 .cse20)))) [2021-08-25 20:13:50,134 INFO L857 garLoopResultBuilder]: For program point L497(lines 497 499) no Hoare annotation was computed. [2021-08-25 20:13:50,134 INFO L857 garLoopResultBuilder]: For program point L497-2(lines 209 543) no Hoare annotation was computed. [2021-08-25 20:13:50,134 INFO L853 garLoopResultBuilder]: At program point L398(lines 389 407) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-08-25 20:13:50,134 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 236) no Hoare annotation was computed. [2021-08-25 20:13:50,134 INFO L853 garLoopResultBuilder]: At program point L167(lines 166 559) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2) (and .cse0 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse0) (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 .cse2) (and .cse3 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2021-08-25 20:13:50,135 INFO L853 garLoopResultBuilder]: At program point L134(lines 127 572) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-08-25 20:13:50,135 INFO L857 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2021-08-25 20:13:50,139 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:13:50,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:13:50 BoogieIcfgContainer [2021-08-25 20:13:50,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:13:50,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:13:50,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:13:50,171 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:13:50,171 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:19" (3/4) ... [2021-08-25 20:13:50,174 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:13:50,187 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:13:50,188 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:13:50,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:50,190 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:50,277 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:13:50,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:13:50,279 INFO L168 Benchmark]: Toolchain (without parser) took 32401.35 ms. Allocated memory was 69.2 MB in the beginning and 629.1 MB in the end (delta: 559.9 MB). Free memory was 48.9 MB in the beginning and 379.4 MB in the end (delta: -330.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:50,280 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 69.2 MB. Free memory is still 51.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:13:50,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.52 ms. Allocated memory is still 69.2 MB. Free memory was 48.7 MB in the beginning and 49.5 MB in the end (delta: -751.2 kB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:50,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.97 ms. Allocated memory is still 69.2 MB. Free memory was 49.4 MB in the beginning and 46.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:50,281 INFO L168 Benchmark]: Boogie Preprocessor took 41.69 ms. Allocated memory is still 69.2 MB. Free memory was 46.4 MB in the beginning and 44.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:50,281 INFO L168 Benchmark]: RCFGBuilder took 886.62 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 44.3 MB in the beginning and 44.0 MB in the end (delta: 302.2 kB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:50,281 INFO L168 Benchmark]: TraceAbstraction took 30815.95 ms. Allocated memory was 83.9 MB in the beginning and 629.1 MB in the end (delta: 545.3 MB). Free memory was 43.5 MB in the beginning and 393.0 MB in the end (delta: -349.4 MB). Peak memory consumption was 371.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:50,282 INFO L168 Benchmark]: Witness Printer took 107.09 ms. Allocated memory is still 629.1 MB. Free memory was 393.0 MB in the beginning and 379.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:50,286 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 69.2 MB. Free memory is still 51.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 458.52 ms. Allocated memory is still 69.2 MB. Free memory was 48.7 MB in the beginning and 49.5 MB in the end (delta: -751.2 kB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.97 ms. Allocated memory is still 69.2 MB. Free memory was 49.4 MB in the beginning and 46.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.69 ms. Allocated memory is still 69.2 MB. Free memory was 46.4 MB in the beginning and 44.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 886.62 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 44.3 MB in the beginning and 44.0 MB in the end (delta: 302.2 kB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30815.95 ms. Allocated memory was 83.9 MB in the beginning and 629.1 MB in the end (delta: 545.3 MB). Free memory was 43.5 MB in the beginning and 393.0 MB in the end (delta: -349.4 MB). Peak memory consumption was 371.2 MB. Max. memory is 16.1 GB. * Witness Printer took 107.09 ms. Allocated memory is still 629.1 MB. Free memory was 393.0 MB in the beginning and 379.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 609]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30731.3ms, OverallIterations: 35, TraceHistogramMax: 19, EmptinessCheckTime: 138.9ms, AutomataDifference: 6712.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 11143.2ms, InitialAbstractionConstructionTime: 18.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6694 SDtfs, 4128 SDslu, 3183 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3383.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1999 GetRequests, 1954 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 217.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4086occurred in iteration=27, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1648.5ms AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3241 HoareAnnotationTreeSize, 28 FomulaSimplifications, 154560 FormulaSimplificationTreeSizeReduction, 2042.8ms HoareSimplificationTime, 28 FomulaSimplificationsInter, 31171 FormulaSimplificationTreeSizeReductionInter, 9075.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 240.2ms SsaConstructionTime, 805.2ms SatisfiabilityAnalysisTime, 6988.5ms InterpolantComputationTime, 9249 NumberOfCodeBlocks, 9249 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9209 ConstructedInterpolants, 0 QuantifiedInterpolants, 12714 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && !(8448 == s__state)) && blastFlag == 1) && s__state <= 8448) || (((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && s__state <= 8448)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && s__state <= 8448) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && s__state == 8528) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag == 1 && s__state <= 3)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && s__state == 8608) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((s__state <= 8576 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((s__state == 8544 && s__hit == 0) && 2 == blastFlag)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8592) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8512) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (s__state == 8592 && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 8560 == s__state)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (blastFlag == 0 && s__state <= 3)) || (blastFlag == 0 && s__state == 8608)) || ((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || ((((s__state <= 8672 && !(s__state == 8657)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag)) || ((((s__hit == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576)) || (s__state == 8608 && blastFlag == 1)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (s__state == 8592 && blastFlag == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && !(s__hit == 0))) || (2 == blastFlag && s__state <= 3) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8672) && s__state <= 8672) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag) || (((!(s__state == 8672) && blastFlag == 0) && s__state <= 8672) && 8640 <= s__state)) || ((((!(s__state == 8672) && s__state <= 8672) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((!(s__state == 8672) && s__hit == 0) && s__state <= 8672) && 8640 <= s__state) && blastFlag == 1) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) || (((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && 8640 <= s__state) && blastFlag == 1)) || ((((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || ((((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag)) || (((((!(s__state == 8672) && blastFlag == 0) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && 8640 <= s__state) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || ((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && blastFlag == 1) && s__state <= 8448) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || ((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && blastFlag == 0) && !(12292 == s__state)) || (((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 1)) || (((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state == 8608) || (s__state == 8608 && blastFlag == 1)) || (((s__hit == 0 && s__state == 8608) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && s__state == 8528) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag == 1 && s__state <= 3)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && s__state == 8608) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((s__state <= 8576 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((s__state == 8544 && s__hit == 0) && 2 == blastFlag)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8592) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8512) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (s__state == 8592 && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 8560 == s__state)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (blastFlag == 0 && s__state <= 3)) || (blastFlag == 0 && s__state == 8608)) || ((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || ((((s__state <= 8672 && !(s__state == 8657)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag)) || ((((s__hit == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576)) || (s__state == 8608 && blastFlag == 1)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (s__state == 8592 && blastFlag == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && !(s__hit == 0))) || (2 == blastFlag && s__state <= 3) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:13:50,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...