./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_7.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_7.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 64fc077d874a336f18c68c9b79d68b4c2009b140 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:36,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:13:36,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:13:36,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:13:36,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:13:36,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:13:36,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:13:36,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:13:36,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:13:36,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:13:36,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:13:36,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:13:36,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:13:36,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:13:36,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:13:36,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:13:36,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:13:36,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:13:36,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:13:36,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:13:36,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:13:36,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:13:36,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:13:36,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:13:36,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:13:36,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:13:36,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:13:36,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:13:36,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:13:36,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:13:36,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:13:36,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:13:36,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:13:36,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:13:36,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:13:36,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:13:36,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:13:36,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:13:36,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:13:36,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:13:36,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:13:36,926 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:36,961 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:13:36,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:13:36,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:13:36,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:13:36,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:13:36,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:13:36,965 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:13:36,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:13:36,965 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:13:36,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:13:36,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:13:36,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:13:36,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:13:36,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:13:36,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:13:36,967 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:13:36,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:13:36,968 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:13:36,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:13:36,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:13:36,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:13:36,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:13:36,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:36,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:13:36,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:13:36,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:13:36,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:13:36,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:13:36,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:13:36,970 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:13:36,970 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 -> 64fc077d874a336f18c68c9b79d68b4c2009b140 [2021-08-25 20:13:37,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:13:37,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:13:37,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:13:37,291 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:13:37,291 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:13:37,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_7.cil.c [2021-08-25 20:13:37,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe02a9be2/c8573aaed45944c9a94077c7098eea8d/FLAGb6d06c926 [2021-08-25 20:13:37,742 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:13:37,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_7.cil.c [2021-08-25 20:13:37,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe02a9be2/c8573aaed45944c9a94077c7098eea8d/FLAGb6d06c926 [2021-08-25 20:13:38,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe02a9be2/c8573aaed45944c9a94077c7098eea8d [2021-08-25 20:13:38,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:13:38,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:13:38,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:38,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:13:38,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:13:38,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:38" (1/1) ... [2021-08-25 20:13:38,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6716495c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:38, skipping insertion in model container [2021-08-25 20:13:38,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:38" (1/1) ... [2021-08-25 20:13:38,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:13:38,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:13:38,401 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_7.cil.c[43871,43884] [2021-08-25 20:13:38,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:38,474 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:13:38,546 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_7.cil.c[43871,43884] [2021-08-25 20:13:38,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:38,568 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:13:38,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:38 WrapperNode [2021-08-25 20:13:38,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:38,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:38,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:13:38,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:13:38,584 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:38" (1/1) ... [2021-08-25 20:13:38,605 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:38" (1/1) ... [2021-08-25 20:13:38,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:38,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:13:38,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:13:38,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:13:38,658 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:38" (1/1) ... [2021-08-25 20:13:38,659 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:38" (1/1) ... [2021-08-25 20:13:38,663 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:38" (1/1) ... [2021-08-25 20:13:38,663 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:38" (1/1) ... [2021-08-25 20:13:38,678 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:38" (1/1) ... [2021-08-25 20:13:38,685 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:38" (1/1) ... [2021-08-25 20:13:38,686 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:38" (1/1) ... [2021-08-25 20:13:38,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:13:38,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:13:38,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:13:38,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:13:38,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:38" (1/1) ... [2021-08-25 20:13:38,697 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:38,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:38,726 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:38,742 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:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:13:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:13:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:13:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:13:38,902 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:13:39,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:13:39,286 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:13:39,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:13:39,292 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:13:39,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:39 BoogieIcfgContainer [2021-08-25 20:13:39,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:13:39,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:13:39,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:13:39,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:13:39,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:13:38" (1/3) ... [2021-08-25 20:13:39,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b01e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:39, skipping insertion in model container [2021-08-25 20:13:39,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:38" (2/3) ... [2021-08-25 20:13:39,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b01e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:39, skipping insertion in model container [2021-08-25 20:13:39,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:39" (3/3) ... [2021-08-25 20:13:39,298 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2021-08-25 20:13:39,302 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:13:39,302 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:13:39,330 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:13:39,335 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:39,335 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:13:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 145 states have internal predecessors, (250), 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:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:13:39,351 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:39,351 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] [2021-08-25 20:13:39,352 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1801233509, now seen corresponding path program 1 times [2021-08-25 20:13:39,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:39,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411283701] [2021-08-25 20:13:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:39,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:39,551 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:39,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:39,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411283701] [2021-08-25 20:13:39,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411283701] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:39,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:39,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:39,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217489592] [2021-08-25 20:13:39,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:39,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:39,577 INFO L87 Difference]: Start difference. First operand has 146 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 145 states have internal predecessors, (250), 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 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:39,770 INFO L93 Difference]: Finished difference Result 329 states and 565 transitions. [2021-08-25 20:13:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2021-08-25 20:13:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:39,782 INFO L225 Difference]: With dead ends: 329 [2021-08-25 20:13:39,783 INFO L226 Difference]: Without dead ends: 171 [2021-08-25 20:13:39,785 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-25 20:13:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2021-08-25 20:13:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.6037735849056605) internal successors, (255), 159 states have internal predecessors, (255), 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:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 255 transitions. [2021-08-25 20:13:39,833 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 255 transitions. Word has length 33 [2021-08-25 20:13:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:39,834 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 255 transitions. [2021-08-25 20:13:39,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 255 transitions. [2021-08-25 20:13:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:13:39,837 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:39,837 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] [2021-08-25 20:13:39,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:13:39,837 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash -979083820, now seen corresponding path program 1 times [2021-08-25 20:13:39,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:39,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459617589] [2021-08-25 20:13:39,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:39,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:39,924 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:39,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:39,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459617589] [2021-08-25 20:13:39,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459617589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:39,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:39,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:39,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377947660] [2021-08-25 20:13:39,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:39,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:39,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:39,928 INFO L87 Difference]: Start difference. First operand 160 states and 255 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:40,073 INFO L93 Difference]: Finished difference Result 351 states and 566 transitions. [2021-08-25 20:13:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:40,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-08-25 20:13:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:40,076 INFO L225 Difference]: With dead ends: 351 [2021-08-25 20:13:40,076 INFO L226 Difference]: Without dead ends: 199 [2021-08-25 20:13:40,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-08-25 20:13:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 188. [2021-08-25 20:13:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6363636363636365) internal successors, (306), 187 states have internal predecessors, (306), 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:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 306 transitions. [2021-08-25 20:13:40,100 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 306 transitions. Word has length 34 [2021-08-25 20:13:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:40,100 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 306 transitions. [2021-08-25 20:13:40,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 306 transitions. [2021-08-25 20:13:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-25 20:13:40,104 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:40,104 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] [2021-08-25 20:13:40,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:13:40,105 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1380253296, now seen corresponding path program 1 times [2021-08-25 20:13:40,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:40,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882250540] [2021-08-25 20:13:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:40,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:40,174 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:40,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:40,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882250540] [2021-08-25 20:13:40,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882250540] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:40,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:40,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:40,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149591557] [2021-08-25 20:13:40,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:40,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:40,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,181 INFO L87 Difference]: Start difference. First operand 188 states and 306 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:40,322 INFO L93 Difference]: Finished difference Result 412 states and 677 transitions. [2021-08-25 20:13:40,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:40,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2021-08-25 20:13:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:40,323 INFO L225 Difference]: With dead ends: 412 [2021-08-25 20:13:40,323 INFO L226 Difference]: Without dead ends: 232 [2021-08-25 20:13:40,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-08-25 20:13:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 226. [2021-08-25 20:13:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 225 states have internal predecessors, (375), 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:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 375 transitions. [2021-08-25 20:13:40,331 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 375 transitions. Word has length 40 [2021-08-25 20:13:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:40,332 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 375 transitions. [2021-08-25 20:13:40,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 375 transitions. [2021-08-25 20:13:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:13:40,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:40,333 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] [2021-08-25 20:13:40,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:13:40,333 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash -168828142, now seen corresponding path program 1 times [2021-08-25 20:13:40,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:40,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581877651] [2021-08-25 20:13:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:40,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:40,366 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:40,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:40,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581877651] [2021-08-25 20:13:40,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581877651] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:40,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:40,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:40,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540048526] [2021-08-25 20:13:40,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:40,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:40,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,369 INFO L87 Difference]: Start difference. First operand 226 states and 375 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:40,496 INFO L93 Difference]: Finished difference Result 461 states and 767 transitions. [2021-08-25 20:13:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:40,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2021-08-25 20:13:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:40,498 INFO L225 Difference]: With dead ends: 461 [2021-08-25 20:13:40,498 INFO L226 Difference]: Without dead ends: 243 [2021-08-25 20:13:40,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-08-25 20:13:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2021-08-25 20:13:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.6779661016949152) internal successors, (396), 236 states have internal predecessors, (396), 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:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 396 transitions. [2021-08-25 20:13:40,505 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 396 transitions. Word has length 41 [2021-08-25 20:13:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:40,505 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 396 transitions. [2021-08-25 20:13:40,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 396 transitions. [2021-08-25 20:13:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:13:40,506 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:40,507 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:13:40,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:13:40,507 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:40,507 INFO L82 PathProgramCache]: Analyzing trace with hash -202979865, now seen corresponding path program 1 times [2021-08-25 20:13:40,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:40,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042550968] [2021-08-25 20:13:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:40,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:40,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:40,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042550968] [2021-08-25 20:13:40,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042550968] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:40,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:40,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:40,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62535497] [2021-08-25 20:13:40,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:40,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:40,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,541 INFO L87 Difference]: Start difference. First operand 237 states and 396 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:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:40,643 INFO L93 Difference]: Finished difference Result 505 states and 849 transitions. [2021-08-25 20:13:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:40,643 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 59 [2021-08-25 20:13:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:40,644 INFO L225 Difference]: With dead ends: 505 [2021-08-25 20:13:40,644 INFO L226 Difference]: Without dead ends: 276 [2021-08-25 20:13:40,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-25 20:13:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 262. [2021-08-25 20:13:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.681992337164751) internal successors, (439), 261 states have internal predecessors, (439), 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:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 439 transitions. [2021-08-25 20:13:40,650 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 439 transitions. Word has length 59 [2021-08-25 20:13:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:40,651 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 439 transitions. [2021-08-25 20:13:40,651 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:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 439 transitions. [2021-08-25 20:13:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:13:40,652 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:40,652 INFO L512 BasicCegarLoop]: trace histogram [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:40,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:13:40,652 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash 654012288, now seen corresponding path program 1 times [2021-08-25 20:13:40,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:40,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217013176] [2021-08-25 20:13:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:40,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:40,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:40,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217013176] [2021-08-25 20:13:40,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217013176] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:40,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:40,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:40,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902949128] [2021-08-25 20:13:40,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:40,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:40,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:40,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,695 INFO L87 Difference]: Start difference. First operand 262 states and 439 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:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:40,810 INFO L93 Difference]: Finished difference Result 530 states and 889 transitions. [2021-08-25 20:13:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:40,811 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 60 [2021-08-25 20:13:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:40,812 INFO L225 Difference]: With dead ends: 530 [2021-08-25 20:13:40,812 INFO L226 Difference]: Without dead ends: 276 [2021-08-25 20:13:40,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-25 20:13:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 262. [2021-08-25 20:13:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.6704980842911878) internal successors, (436), 261 states have internal predecessors, (436), 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:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2021-08-25 20:13:40,818 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 60 [2021-08-25 20:13:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:40,818 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2021-08-25 20:13:40,818 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:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2021-08-25 20:13:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-25 20:13:40,819 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:40,819 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:13:40,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:13:40,820 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash 225756320, now seen corresponding path program 1 times [2021-08-25 20:13:40,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:40,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714049520] [2021-08-25 20:13:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:40,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:40,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:40,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714049520] [2021-08-25 20:13:40,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714049520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:40,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:40,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:40,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609218347] [2021-08-25 20:13:40,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:40,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,846 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:40,991 INFO L93 Difference]: Finished difference Result 547 states and 914 transitions. [2021-08-25 20:13:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:40,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2021-08-25 20:13:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:40,993 INFO L225 Difference]: With dead ends: 547 [2021-08-25 20:13:40,993 INFO L226 Difference]: Without dead ends: 293 [2021-08-25 20:13:40,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-08-25 20:13:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-08-25 20:13:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6712328767123288) internal successors, (488), 292 states have internal predecessors, (488), 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:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 488 transitions. [2021-08-25 20:13:41,002 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 488 transitions. Word has length 61 [2021-08-25 20:13:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:41,003 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 488 transitions. [2021-08-25 20:13:41,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 488 transitions. [2021-08-25 20:13:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-25 20:13:41,009 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:41,009 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, 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:41,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:13:41,009 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1734857866, now seen corresponding path program 1 times [2021-08-25 20:13:41,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:41,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257652323] [2021-08-25 20:13:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:41,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-25 20:13:41,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:41,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257652323] [2021-08-25 20:13:41,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257652323] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:41,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:41,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:41,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63097848] [2021-08-25 20:13:41,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:41,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:41,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,090 INFO L87 Difference]: Start difference. First operand 293 states and 488 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:41,281 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-08-25 20:13:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:41,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 73 [2021-08-25 20:13:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:41,283 INFO L225 Difference]: With dead ends: 595 [2021-08-25 20:13:41,283 INFO L226 Difference]: Without dead ends: 310 [2021-08-25 20:13:41,294 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:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-08-25 20:13:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2021-08-25 20:13:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.6579804560260587) internal successors, (509), 307 states have internal predecessors, (509), 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:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 509 transitions. [2021-08-25 20:13:41,301 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 509 transitions. Word has length 73 [2021-08-25 20:13:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:41,301 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 509 transitions. [2021-08-25 20:13:41,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 509 transitions. [2021-08-25 20:13:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-25 20:13:41,302 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:41,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:41,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:13:41,302 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1240517537, now seen corresponding path program 1 times [2021-08-25 20:13:41,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:41,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842651812] [2021-08-25 20:13:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:41,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:41,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:41,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842651812] [2021-08-25 20:13:41,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842651812] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:41,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:41,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:41,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556936117] [2021-08-25 20:13:41,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:41,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,328 INFO L87 Difference]: Start difference. First operand 308 states and 509 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:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:41,456 INFO L93 Difference]: Finished difference Result 646 states and 1070 transitions. [2021-08-25 20:13:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:41,457 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 73 [2021-08-25 20:13:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:41,458 INFO L225 Difference]: With dead ends: 646 [2021-08-25 20:13:41,458 INFO L226 Difference]: Without dead ends: 346 [2021-08-25 20:13:41,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-08-25 20:13:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2021-08-25 20:13:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.6588921282798834) internal successors, (569), 343 states have internal predecessors, (569), 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:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 569 transitions. [2021-08-25 20:13:41,467 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 569 transitions. Word has length 73 [2021-08-25 20:13:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:41,467 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 569 transitions. [2021-08-25 20:13:41,467 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:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 569 transitions. [2021-08-25 20:13:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:13:41,468 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:41,468 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, 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:41,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:13:41,468 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1544129923, now seen corresponding path program 1 times [2021-08-25 20:13:41,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:41,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823949629] [2021-08-25 20:13:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:41,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-25 20:13:41,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:41,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823949629] [2021-08-25 20:13:41,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823949629] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:41,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:41,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:41,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705620325] [2021-08-25 20:13:41,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:41,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,506 INFO L87 Difference]: Start difference. First operand 344 states and 569 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:41,605 INFO L93 Difference]: Finished difference Result 682 states and 1128 transitions. [2021-08-25 20:13:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 74 [2021-08-25 20:13:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:41,607 INFO L225 Difference]: With dead ends: 682 [2021-08-25 20:13:41,607 INFO L226 Difference]: Without dead ends: 346 [2021-08-25 20:13:41,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-08-25 20:13:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2021-08-25 20:13:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.641399416909621) internal successors, (563), 343 states have internal predecessors, (563), 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:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 563 transitions. [2021-08-25 20:13:41,615 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 563 transitions. Word has length 74 [2021-08-25 20:13:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:41,615 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 563 transitions. [2021-08-25 20:13:41,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 563 transitions. [2021-08-25 20:13:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:13:41,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:41,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:41,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:13:41,616 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1602665309, now seen corresponding path program 1 times [2021-08-25 20:13:41,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:41,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699828520] [2021-08-25 20:13:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:41,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:41,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:41,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699828520] [2021-08-25 20:13:41,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699828520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:41,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:41,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:41,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705047339] [2021-08-25 20:13:41,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:41,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,639 INFO L87 Difference]: Start difference. First operand 344 states and 563 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:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:41,842 INFO L93 Difference]: Finished difference Result 682 states and 1116 transitions. [2021-08-25 20:13:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:41,843 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 74 [2021-08-25 20:13:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:41,844 INFO L225 Difference]: With dead ends: 682 [2021-08-25 20:13:41,844 INFO L226 Difference]: Without dead ends: 346 [2021-08-25 20:13:41,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-08-25 20:13:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2021-08-25 20:13:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.6355685131195334) internal successors, (561), 343 states have internal predecessors, (561), 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:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 561 transitions. [2021-08-25 20:13:41,855 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 561 transitions. Word has length 74 [2021-08-25 20:13:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:41,855 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 561 transitions. [2021-08-25 20:13:41,855 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:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 561 transitions. [2021-08-25 20:13:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-25 20:13:41,856 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:41,856 INFO L512 BasicCegarLoop]: trace histogram [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:41,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:13:41,856 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2140763865, now seen corresponding path program 1 times [2021-08-25 20:13:41,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:41,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064692837] [2021-08-25 20:13:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:41,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-25 20:13:41,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:41,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064692837] [2021-08-25 20:13:41,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064692837] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:41,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:41,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:41,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302927675] [2021-08-25 20:13:41,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:41,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:41,885 INFO L87 Difference]: Start difference. First operand 344 states and 561 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:42,011 INFO L93 Difference]: Finished difference Result 709 states and 1158 transitions. [2021-08-25 20:13:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:42,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 80 [2021-08-25 20:13:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:42,013 INFO L225 Difference]: With dead ends: 709 [2021-08-25 20:13:42,013 INFO L226 Difference]: Without dead ends: 373 [2021-08-25 20:13:42,014 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:42,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-08-25 20:13:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 368. [2021-08-25 20:13:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.6239782016348774) internal successors, (596), 367 states have internal predecessors, (596), 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:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 596 transitions. [2021-08-25 20:13:42,022 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 596 transitions. Word has length 80 [2021-08-25 20:13:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:42,022 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 596 transitions. [2021-08-25 20:13:42,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 596 transitions. [2021-08-25 20:13:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-25 20:13:42,023 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:42,024 INFO L512 BasicCegarLoop]: trace histogram [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:42,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:13:42,024 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -210999154, now seen corresponding path program 1 times [2021-08-25 20:13:42,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:42,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804564759] [2021-08-25 20:13:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:42,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-25 20:13:42,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:42,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804564759] [2021-08-25 20:13:42,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804564759] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:42,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:42,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:42,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312959270] [2021-08-25 20:13:42,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:42,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:42,047 INFO L87 Difference]: Start difference. First operand 368 states and 596 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:42,182 INFO L93 Difference]: Finished difference Result 733 states and 1187 transitions. [2021-08-25 20:13:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 81 [2021-08-25 20:13:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:42,184 INFO L225 Difference]: With dead ends: 733 [2021-08-25 20:13:42,184 INFO L226 Difference]: Without dead ends: 373 [2021-08-25 20:13:42,184 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:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-08-25 20:13:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 368. [2021-08-25 20:13:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.6076294277929155) internal successors, (590), 367 states have internal predecessors, (590), 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:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2021-08-25 20:13:42,192 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 81 [2021-08-25 20:13:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:42,193 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2021-08-25 20:13:42,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2021-08-25 20:13:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:13:42,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:42,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:13:42,194 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 421977602, now seen corresponding path program 1 times [2021-08-25 20:13:42,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:42,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444386251] [2021-08-25 20:13:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:42,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-08-25 20:13:42,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:42,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444386251] [2021-08-25 20:13:42,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444386251] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:42,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:42,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:42,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508510747] [2021-08-25 20:13:42,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:42,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:42,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:42,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:42,216 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:42,315 INFO L93 Difference]: Finished difference Result 737 states and 1180 transitions. [2021-08-25 20:13:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:42,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 86 [2021-08-25 20:13:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:42,317 INFO L225 Difference]: With dead ends: 737 [2021-08-25 20:13:42,317 INFO L226 Difference]: Without dead ends: 377 [2021-08-25 20:13:42,318 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:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-08-25 20:13:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-08-25 20:13:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.577127659574468) internal successors, (593), 376 states have internal predecessors, (593), 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:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 593 transitions. [2021-08-25 20:13:42,327 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 593 transitions. Word has length 86 [2021-08-25 20:13:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:42,327 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 593 transitions. [2021-08-25 20:13:42,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 593 transitions. [2021-08-25 20:13:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:13:42,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:42,329 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, 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:42,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:13:42,329 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1302259833, now seen corresponding path program 1 times [2021-08-25 20:13:42,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:42,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125027156] [2021-08-25 20:13:42,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:42,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-25 20:13:42,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:42,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125027156] [2021-08-25 20:13:42,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125027156] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:42,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:42,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:42,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297922075] [2021-08-25 20:13:42,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:42,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:42,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:42,362 INFO L87 Difference]: Start difference. First operand 377 states and 593 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:42,513 INFO L93 Difference]: Finished difference Result 777 states and 1221 transitions. [2021-08-25 20:13:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 87 [2021-08-25 20:13:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:42,515 INFO L225 Difference]: With dead ends: 777 [2021-08-25 20:13:42,516 INFO L226 Difference]: Without dead ends: 408 [2021-08-25 20:13:42,516 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:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-08-25 20:13:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2021-08-25 20:13:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.565432098765432) internal successors, (634), 405 states have internal predecessors, (634), 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:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 634 transitions. [2021-08-25 20:13:42,526 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 634 transitions. Word has length 87 [2021-08-25 20:13:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:42,527 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 634 transitions. [2021-08-25 20:13:42,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 634 transitions. [2021-08-25 20:13:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:13:42,528 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:42,528 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, 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:42,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:13:42,529 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:42,529 INFO L82 PathProgramCache]: Analyzing trace with hash 393392224, now seen corresponding path program 1 times [2021-08-25 20:13:42,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:42,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880024298] [2021-08-25 20:13:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:42,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-25 20:13:42,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:42,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880024298] [2021-08-25 20:13:42,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880024298] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:42,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:42,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:42,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060699734] [2021-08-25 20:13:42,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:42,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:42,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:42,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:42,553 INFO L87 Difference]: Start difference. First operand 406 states and 634 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:42,691 INFO L93 Difference]: Finished difference Result 806 states and 1258 transitions. [2021-08-25 20:13:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:42,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 88 [2021-08-25 20:13:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:42,694 INFO L225 Difference]: With dead ends: 806 [2021-08-25 20:13:42,694 INFO L226 Difference]: Without dead ends: 408 [2021-08-25 20:13:42,695 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:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-08-25 20:13:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2021-08-25 20:13:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.5555555555555556) internal successors, (630), 405 states have internal predecessors, (630), 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:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 630 transitions. [2021-08-25 20:13:42,712 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 630 transitions. Word has length 88 [2021-08-25 20:13:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:42,712 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 630 transitions. [2021-08-25 20:13:42,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 630 transitions. [2021-08-25 20:13:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:13:42,714 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:42,714 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-08-25 20:13:42,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:13:42,714 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1251587347, now seen corresponding path program 1 times [2021-08-25 20:13:42,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:42,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962001960] [2021-08-25 20:13:42,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:42,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-08-25 20:13:42,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:42,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962001960] [2021-08-25 20:13:42,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962001960] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:42,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:42,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:42,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292873769] [2021-08-25 20:13:42,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:42,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:42,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:42,746 INFO L87 Difference]: Start difference. First operand 406 states and 630 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:42,879 INFO L93 Difference]: Finished difference Result 829 states and 1289 transitions. [2021-08-25 20:13:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:42,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:42,885 INFO L225 Difference]: With dead ends: 829 [2021-08-25 20:13:42,885 INFO L226 Difference]: Without dead ends: 431 [2021-08-25 20:13:42,886 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:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-08-25 20:13:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2021-08-25 20:13:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.5422535211267605) internal successors, (657), 426 states have internal predecessors, (657), 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:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 657 transitions. [2021-08-25 20:13:42,900 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 657 transitions. Word has length 101 [2021-08-25 20:13:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:42,900 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 657 transitions. [2021-08-25 20:13:42,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 657 transitions. [2021-08-25 20:13:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:13:42,902 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:42,902 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2021-08-25 20:13:42,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:13:42,902 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1106485420, now seen corresponding path program 1 times [2021-08-25 20:13:42,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:42,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682368756] [2021-08-25 20:13:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:42,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-08-25 20:13:42,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:42,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682368756] [2021-08-25 20:13:42,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682368756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:42,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:42,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:42,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274850531] [2021-08-25 20:13:42,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:42,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:42,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:42,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:42,938 INFO L87 Difference]: Start difference. First operand 427 states and 657 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:43,058 INFO L93 Difference]: Finished difference Result 850 states and 1308 transitions. [2021-08-25 20:13:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 102 [2021-08-25 20:13:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:43,060 INFO L225 Difference]: With dead ends: 850 [2021-08-25 20:13:43,060 INFO L226 Difference]: Without dead ends: 431 [2021-08-25 20:13:43,063 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:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-08-25 20:13:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2021-08-25 20:13:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.5234741784037558) internal successors, (649), 426 states have internal predecessors, (649), 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:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 649 transitions. [2021-08-25 20:13:43,074 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 649 transitions. Word has length 102 [2021-08-25 20:13:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:43,074 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 649 transitions. [2021-08-25 20:13:43,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 649 transitions. [2021-08-25 20:13:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:13:43,076 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:43,076 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, 1, 1, 1] [2021-08-25 20:13:43,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:13:43,076 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:43,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:43,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1116164692, now seen corresponding path program 1 times [2021-08-25 20:13:43,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:43,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585374395] [2021-08-25 20:13:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:43,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-25 20:13:43,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:43,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585374395] [2021-08-25 20:13:43,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585374395] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:43,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:43,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:43,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839355704] [2021-08-25 20:13:43,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:43,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:43,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:43,112 INFO L87 Difference]: Start difference. First operand 427 states and 649 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:43,288 INFO L93 Difference]: Finished difference Result 891 states and 1352 transitions. [2021-08-25 20:13:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 103 [2021-08-25 20:13:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:43,290 INFO L225 Difference]: With dead ends: 891 [2021-08-25 20:13:43,290 INFO L226 Difference]: Without dead ends: 472 [2021-08-25 20:13:43,291 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:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-08-25 20:13:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 469. [2021-08-25 20:13:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.517094017094017) internal successors, (710), 468 states have internal predecessors, (710), 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:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 710 transitions. [2021-08-25 20:13:43,306 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 710 transitions. Word has length 103 [2021-08-25 20:13:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:43,307 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 710 transitions. [2021-08-25 20:13:43,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 710 transitions. [2021-08-25 20:13:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:13:43,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:43,309 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, 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] [2021-08-25 20:13:43,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:13:43,309 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash 816244885, now seen corresponding path program 1 times [2021-08-25 20:13:43,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:43,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918011298] [2021-08-25 20:13:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:43,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-25 20:13:43,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:43,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918011298] [2021-08-25 20:13:43,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918011298] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:43,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:43,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:43,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895382330] [2021-08-25 20:13:43,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:43,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:43,341 INFO L87 Difference]: Start difference. First operand 469 states and 710 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:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:43,488 INFO L93 Difference]: Finished difference Result 966 states and 1460 transitions. [2021-08-25 20:13:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:43,489 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 104 [2021-08-25 20:13:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:43,491 INFO L225 Difference]: With dead ends: 966 [2021-08-25 20:13:43,491 INFO L226 Difference]: Without dead ends: 505 [2021-08-25 20:13:43,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-08-25 20:13:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 503. [2021-08-25 20:13:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.5059760956175299) internal successors, (756), 502 states have internal predecessors, (756), 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:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 756 transitions. [2021-08-25 20:13:43,505 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 756 transitions. Word has length 104 [2021-08-25 20:13:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:43,505 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 756 transitions. [2021-08-25 20:13:43,505 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:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 756 transitions. [2021-08-25 20:13:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:13:43,506 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:43,507 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, 1, 1, 1, 1] [2021-08-25 20:13:43,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:13:43,507 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash 64096946, now seen corresponding path program 1 times [2021-08-25 20:13:43,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:43,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437560218] [2021-08-25 20:13:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:43,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-25 20:13:43,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:43,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437560218] [2021-08-25 20:13:43,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437560218] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:43,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:43,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:43,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962033168] [2021-08-25 20:13:43,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:43,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:43,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:43,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:43,555 INFO L87 Difference]: Start difference. First operand 503 states and 756 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:43,802 INFO L93 Difference]: Finished difference Result 1005 states and 1511 transitions. [2021-08-25 20:13:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 104 [2021-08-25 20:13:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:43,806 INFO L225 Difference]: With dead ends: 1005 [2021-08-25 20:13:43,820 INFO L226 Difference]: Without dead ends: 508 [2021-08-25 20:13:43,821 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:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-08-25 20:13:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 505. [2021-08-25 20:13:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.505952380952381) internal successors, (759), 504 states have internal predecessors, (759), 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:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 759 transitions. [2021-08-25 20:13:43,848 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 759 transitions. Word has length 104 [2021-08-25 20:13:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:43,849 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 759 transitions. [2021-08-25 20:13:43,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 759 transitions. [2021-08-25 20:13:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:13:43,851 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:43,851 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, 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] [2021-08-25 20:13:43,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:13:43,851 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -312369545, now seen corresponding path program 1 times [2021-08-25 20:13:43,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:43,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380591461] [2021-08-25 20:13:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:43,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-25 20:13:43,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:43,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380591461] [2021-08-25 20:13:43,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380591461] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:43,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:43,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:43,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031467218] [2021-08-25 20:13:43,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:43,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:43,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:43,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:43,905 INFO L87 Difference]: Start difference. First operand 505 states and 759 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:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:44,083 INFO L93 Difference]: Finished difference Result 1004 states and 1508 transitions. [2021-08-25 20:13:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:44,083 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 105 [2021-08-25 20:13:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:44,086 INFO L225 Difference]: With dead ends: 1004 [2021-08-25 20:13:44,086 INFO L226 Difference]: Without dead ends: 507 [2021-08-25 20:13:44,086 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:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-08-25 20:13:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2021-08-25 20:13:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.498015873015873) internal successors, (755), 504 states have internal predecessors, (755), 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:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 755 transitions. [2021-08-25 20:13:44,101 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 755 transitions. Word has length 105 [2021-08-25 20:13:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:44,101 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 755 transitions. [2021-08-25 20:13:44,101 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:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 755 transitions. [2021-08-25 20:13:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:13:44,103 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:44,103 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2021-08-25 20:13:44,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:13:44,103 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1900430797, now seen corresponding path program 1 times [2021-08-25 20:13:44,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:44,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919870984] [2021-08-25 20:13:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:44,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 20:13:44,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:44,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919870984] [2021-08-25 20:13:44,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919870984] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:44,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:44,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:44,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31770259] [2021-08-25 20:13:44,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:44,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:44,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:44,132 INFO L87 Difference]: Start difference. First operand 505 states and 755 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:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:44,163 INFO L93 Difference]: Finished difference Result 1492 states and 2228 transitions. [2021-08-25 20:13:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:44,164 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 117 [2021-08-25 20:13:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:44,167 INFO L225 Difference]: With dead ends: 1492 [2021-08-25 20:13:44,168 INFO L226 Difference]: Without dead ends: 995 [2021-08-25 20:13:44,168 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:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2021-08-25 20:13:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 506. [2021-08-25 20:13:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.497029702970297) internal successors, (756), 505 states have internal predecessors, (756), 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:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 756 transitions. [2021-08-25 20:13:44,186 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 756 transitions. Word has length 117 [2021-08-25 20:13:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:44,186 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 756 transitions. [2021-08-25 20:13:44,186 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:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 756 transitions. [2021-08-25 20:13:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:13:44,188 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:44,188 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2021-08-25 20:13:44,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:13:44,189 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash 150553201, now seen corresponding path program 1 times [2021-08-25 20:13:44,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:44,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576067228] [2021-08-25 20:13:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:44,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-08-25 20:13:44,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:44,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576067228] [2021-08-25 20:13:44,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576067228] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:44,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:44,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:44,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521639078] [2021-08-25 20:13:44,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:44,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:44,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:44,220 INFO L87 Difference]: Start difference. First operand 506 states and 756 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:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:44,284 INFO L93 Difference]: Finished difference Result 1453 states and 2177 transitions. [2021-08-25 20:13:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:44,285 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 117 [2021-08-25 20:13:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:44,288 INFO L225 Difference]: With dead ends: 1453 [2021-08-25 20:13:44,288 INFO L226 Difference]: Without dead ends: 955 [2021-08-25 20:13:44,289 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:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2021-08-25 20:13:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2021-08-25 20:13:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 1.4937106918238994) internal successors, (1425), 954 states have internal predecessors, (1425), 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:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1425 transitions. [2021-08-25 20:13:44,316 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1425 transitions. Word has length 117 [2021-08-25 20:13:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:44,316 INFO L470 AbstractCegarLoop]: Abstraction has 955 states and 1425 transitions. [2021-08-25 20:13:44,316 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:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1425 transitions. [2021-08-25 20:13:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:13:44,318 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:44,318 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2021-08-25 20:13:44,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:13:44,319 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash -991949265, now seen corresponding path program 1 times [2021-08-25 20:13:44,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:44,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168542805] [2021-08-25 20:13:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:44,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-08-25 20:13:44,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:44,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168542805] [2021-08-25 20:13:44,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168542805] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:44,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:44,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:44,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844925859] [2021-08-25 20:13:44,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:44,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:44,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:44,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:44,347 INFO L87 Difference]: Start difference. First operand 955 states and 1425 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:44,414 INFO L93 Difference]: Finished difference Result 2371 states and 3539 transitions. [2021-08-25 20:13:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:44,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 117 [2021-08-25 20:13:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:44,419 INFO L225 Difference]: With dead ends: 2371 [2021-08-25 20:13:44,420 INFO L226 Difference]: Without dead ends: 1424 [2021-08-25 20:13:44,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-08-25 20:13:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2021-08-25 20:13:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1423 states have (on average 1.4869992972593113) internal successors, (2116), 1423 states have internal predecessors, (2116), 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:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2116 transitions. [2021-08-25 20:13:44,462 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2116 transitions. Word has length 117 [2021-08-25 20:13:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:44,462 INFO L470 AbstractCegarLoop]: Abstraction has 1424 states and 2116 transitions. [2021-08-25 20:13:44,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2116 transitions. [2021-08-25 20:13:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:13:44,465 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:44,465 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2021-08-25 20:13:44,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:13:44,465 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:44,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:44,466 INFO L82 PathProgramCache]: Analyzing trace with hash 39091633, now seen corresponding path program 1 times [2021-08-25 20:13:44,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:44,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780446156] [2021-08-25 20:13:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:44,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:13:44,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:44,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780446156] [2021-08-25 20:13:44,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780446156] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:44,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:44,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:44,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153786454] [2021-08-25 20:13:44,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:44,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:44,493 INFO L87 Difference]: Start difference. First operand 1424 states and 2116 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:44,586 INFO L93 Difference]: Finished difference Result 3314 states and 4927 transitions. [2021-08-25 20:13:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:44,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 117 [2021-08-25 20:13:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:44,593 INFO L225 Difference]: With dead ends: 3314 [2021-08-25 20:13:44,593 INFO L226 Difference]: Without dead ends: 1898 [2021-08-25 20:13:44,594 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:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2021-08-25 20:13:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2021-08-25 20:13:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1897 states have (on average 1.4828676858197154) internal successors, (2813), 1897 states have internal predecessors, (2813), 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:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2813 transitions. [2021-08-25 20:13:44,645 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2813 transitions. Word has length 117 [2021-08-25 20:13:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:44,646 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 2813 transitions. [2021-08-25 20:13:44,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2813 transitions. [2021-08-25 20:13:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 20:13:44,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:44,648 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2021-08-25 20:13:44,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:13:44,649 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1819061573, now seen corresponding path program 1 times [2021-08-25 20:13:44,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:44,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55695779] [2021-08-25 20:13:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:44,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-08-25 20:13:44,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:44,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55695779] [2021-08-25 20:13:44,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55695779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:44,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:44,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:44,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188576703] [2021-08-25 20:13:44,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:44,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:44,678 INFO L87 Difference]: Start difference. First operand 1898 states and 2813 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:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:44,762 INFO L93 Difference]: Finished difference Result 3812 states and 5661 transitions. [2021-08-25 20:13:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:44,763 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 119 [2021-08-25 20:13:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:44,771 INFO L225 Difference]: With dead ends: 3812 [2021-08-25 20:13:44,771 INFO L226 Difference]: Without dead ends: 2396 [2021-08-25 20:13:44,773 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:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2021-08-25 20:13:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2394. [2021-08-25 20:13:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2393 states have (on average 1.4851650647722523) internal successors, (3554), 2393 states have internal predecessors, (3554), 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:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3554 transitions. [2021-08-25 20:13:44,867 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3554 transitions. Word has length 119 [2021-08-25 20:13:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:44,868 INFO L470 AbstractCegarLoop]: Abstraction has 2394 states and 3554 transitions. [2021-08-25 20:13:44,868 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:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3554 transitions. [2021-08-25 20:13:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-25 20:13:44,871 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:44,871 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2021-08-25 20:13:44,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:13:44,872 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 855711090, now seen corresponding path program 1 times [2021-08-25 20:13:44,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:44,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808448798] [2021-08-25 20:13:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:44,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 20:13:44,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:44,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808448798] [2021-08-25 20:13:44,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808448798] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:44,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:44,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:44,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082094533] [2021-08-25 20:13:44,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:44,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:44,905 INFO L87 Difference]: Start difference. First operand 2394 states and 3554 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:45,014 INFO L93 Difference]: Finished difference Result 2894 states and 4299 transitions. [2021-08-25 20:13:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:45,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 120 [2021-08-25 20:13:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:45,024 INFO L225 Difference]: With dead ends: 2894 [2021-08-25 20:13:45,025 INFO L226 Difference]: Without dead ends: 2892 [2021-08-25 20:13:45,026 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:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2021-08-25 20:13:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2021-08-25 20:13:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2889 states have (on average 1.4870197300103842) internal successors, (4296), 2889 states have internal predecessors, (4296), 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:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4296 transitions. [2021-08-25 20:13:45,111 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4296 transitions. Word has length 120 [2021-08-25 20:13:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:45,112 INFO L470 AbstractCegarLoop]: Abstraction has 2890 states and 4296 transitions. [2021-08-25 20:13:45,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4296 transitions. [2021-08-25 20:13:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-08-25 20:13:45,118 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:45,119 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 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:45,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:13:45,119 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2144874353, now seen corresponding path program 1 times [2021-08-25 20:13:45,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:45,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483644679] [2021-08-25 20:13:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:45,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-25 20:13:45,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:45,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483644679] [2021-08-25 20:13:45,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483644679] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:45,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697389237] [2021-08-25 20:13:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:45,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:45,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:45,191 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:45,253 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:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:45,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:13:45,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2021-08-25 20:13:45,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697389237] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:45,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:45,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:45,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147314446] [2021-08-25 20:13:45,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:45,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:45,945 INFO L87 Difference]: Start difference. First operand 2890 states and 4296 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:46,060 INFO L93 Difference]: Finished difference Result 5796 states and 8625 transitions. [2021-08-25 20:13:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:46,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 183 [2021-08-25 20:13:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:46,070 INFO L225 Difference]: With dead ends: 5796 [2021-08-25 20:13:46,070 INFO L226 Difference]: Without dead ends: 3388 [2021-08-25 20:13:46,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2021-08-25 20:13:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3386. [2021-08-25 20:13:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.4818316100443132) internal successors, (5016), 3385 states have internal predecessors, (5016), 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:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5016 transitions. [2021-08-25 20:13:46,164 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5016 transitions. Word has length 183 [2021-08-25 20:13:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:46,164 INFO L470 AbstractCegarLoop]: Abstraction has 3386 states and 5016 transitions. [2021-08-25 20:13:46,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5016 transitions. [2021-08-25 20:13:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-08-25 20:13:46,170 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:46,171 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:13:46,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-25 20:13:46,389 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,SelfDestructingSolverStorable28 [2021-08-25 20:13:46,389 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash 886899251, now seen corresponding path program 1 times [2021-08-25 20:13:46,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:46,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664523130] [2021-08-25 20:13:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:46,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-08-25 20:13:46,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:46,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664523130] [2021-08-25 20:13:46,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664523130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:46,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:46,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:46,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188849183] [2021-08-25 20:13:46,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:46,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:46,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:46,423 INFO L87 Difference]: Start difference. First operand 3386 states and 5016 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:46,559 INFO L93 Difference]: Finished difference Result 6783 states and 10060 transitions. [2021-08-25 20:13:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:46,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 187 [2021-08-25 20:13:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:46,588 INFO L225 Difference]: With dead ends: 6783 [2021-08-25 20:13:46,589 INFO L226 Difference]: Without dead ends: 3879 [2021-08-25 20:13:46,593 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:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2021-08-25 20:13:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 3879. [2021-08-25 20:13:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 3878 states have (on average 1.4814337287261474) internal successors, (5745), 3878 states have internal predecessors, (5745), 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:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5745 transitions. [2021-08-25 20:13:46,840 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5745 transitions. Word has length 187 [2021-08-25 20:13:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:46,841 INFO L470 AbstractCegarLoop]: Abstraction has 3879 states and 5745 transitions. [2021-08-25 20:13:46,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5745 transitions. [2021-08-25 20:13:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-08-25 20:13:46,848 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:46,849 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:13:46,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:13:46,849 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash -67040907, now seen corresponding path program 1 times [2021-08-25 20:13:46,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:46,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040818494] [2021-08-25 20:13:46,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:46,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-08-25 20:13:46,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:46,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040818494] [2021-08-25 20:13:46,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040818494] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:46,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:46,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:46,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400192118] [2021-08-25 20:13:46,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:46,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:46,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:46,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:46,918 INFO L87 Difference]: Start difference. First operand 3879 states and 5745 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:47,030 INFO L93 Difference]: Finished difference Result 5369 states and 7958 transitions. [2021-08-25 20:13:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:47,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 187 [2021-08-25 20:13:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:47,043 INFO L225 Difference]: With dead ends: 5369 [2021-08-25 20:13:47,043 INFO L226 Difference]: Without dead ends: 4375 [2021-08-25 20:13:47,046 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:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2021-08-25 20:13:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 4375. [2021-08-25 20:13:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4375 states, 4374 states have (on average 1.4823959762231367) internal successors, (6484), 4374 states have internal predecessors, (6484), 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:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6484 transitions. [2021-08-25 20:13:47,218 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6484 transitions. Word has length 187 [2021-08-25 20:13:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:47,218 INFO L470 AbstractCegarLoop]: Abstraction has 4375 states and 6484 transitions. [2021-08-25 20:13:47,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6484 transitions. [2021-08-25 20:13:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-08-25 20:13:47,226 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:47,226 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:47,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:13:47,226 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 917057880, now seen corresponding path program 1 times [2021-08-25 20:13:47,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:47,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484331206] [2021-08-25 20:13:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:47,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-08-25 20:13:47,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:47,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484331206] [2021-08-25 20:13:47,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484331206] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:47,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:47,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:47,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474332651] [2021-08-25 20:13:47,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:47,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:47,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:47,257 INFO L87 Difference]: Start difference. First operand 4375 states and 6484 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:47,447 INFO L93 Difference]: Finished difference Result 8825 states and 13084 transitions. [2021-08-25 20:13:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:47,455 INFO L225 Difference]: With dead ends: 8825 [2021-08-25 20:13:47,455 INFO L226 Difference]: Without dead ends: 4458 [2021-08-25 20:13:47,460 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:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2021-08-25 20:13:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 4375. [2021-08-25 20:13:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4375 states, 4374 states have (on average 1.4638774577046183) internal successors, (6403), 4374 states have internal predecessors, (6403), 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:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6403 transitions. [2021-08-25 20:13:47,545 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6403 transitions. Word has length 232 [2021-08-25 20:13:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:47,546 INFO L470 AbstractCegarLoop]: Abstraction has 4375 states and 6403 transitions. [2021-08-25 20:13:47,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6403 transitions. [2021-08-25 20:13:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-08-25 20:13:47,553 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:47,553 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:47,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:13:47,554 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1823531945, now seen corresponding path program 1 times [2021-08-25 20:13:47,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:47,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289506253] [2021-08-25 20:13:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:47,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-08-25 20:13:47,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:47,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289506253] [2021-08-25 20:13:47,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289506253] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:47,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:47,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:47,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348013032] [2021-08-25 20:13:47,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:47,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:47,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:47,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:47,584 INFO L87 Difference]: Start difference. First operand 4375 states and 6403 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:47,766 INFO L93 Difference]: Finished difference Result 8760 states and 12812 transitions. [2021-08-25 20:13:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:47,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 255 [2021-08-25 20:13:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:47,773 INFO L225 Difference]: With dead ends: 8760 [2021-08-25 20:13:47,774 INFO L226 Difference]: Without dead ends: 4393 [2021-08-25 20:13:47,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2021-08-25 20:13:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4375. [2021-08-25 20:13:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4375 states, 4374 states have (on average 1.4453589391860997) internal successors, (6322), 4374 states have internal predecessors, (6322), 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:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6322 transitions. [2021-08-25 20:13:47,855 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6322 transitions. Word has length 255 [2021-08-25 20:13:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:47,856 INFO L470 AbstractCegarLoop]: Abstraction has 4375 states and 6322 transitions. [2021-08-25 20:13:47,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6322 transitions. [2021-08-25 20:13:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-08-25 20:13:47,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:47,862 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:47,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:13:47,863 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1246782490, now seen corresponding path program 1 times [2021-08-25 20:13:47,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:47,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97712057] [2021-08-25 20:13:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:47,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2021-08-25 20:13:47,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:47,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97712057] [2021-08-25 20:13:47,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97712057] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:47,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:47,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:47,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096705217] [2021-08-25 20:13:47,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:47,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:47,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:47,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:47,894 INFO L87 Difference]: Start difference. First operand 4375 states and 6322 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:48,051 INFO L93 Difference]: Finished difference Result 8742 states and 12632 transitions. [2021-08-25 20:13:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:48,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 261 [2021-08-25 20:13:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:48,058 INFO L225 Difference]: With dead ends: 8742 [2021-08-25 20:13:48,058 INFO L226 Difference]: Without dead ends: 4375 [2021-08-25 20:13:48,062 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2021-08-25 20:13:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 4375. [2021-08-25 20:13:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4375 states, 4374 states have (on average 1.426840420667581) internal successors, (6241), 4374 states have internal predecessors, (6241), 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:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6241 transitions. [2021-08-25 20:13:48,148 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6241 transitions. Word has length 261 [2021-08-25 20:13:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:48,148 INFO L470 AbstractCegarLoop]: Abstraction has 4375 states and 6241 transitions. [2021-08-25 20:13:48,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6241 transitions. [2021-08-25 20:13:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-08-25 20:13:48,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:48,155 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:48,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:13:48,155 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:48,155 INFO L82 PathProgramCache]: Analyzing trace with hash -791509653, now seen corresponding path program 2 times [2021-08-25 20:13:48,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:48,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266986694] [2021-08-25 20:13:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:48,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-08-25 20:13:48,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:48,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266986694] [2021-08-25 20:13:48,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266986694] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:48,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878511600] [2021-08-25 20:13:48,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:13:48,198 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:48,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:48,199 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:48,229 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:48,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:13:48,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:13:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:48,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-08-25 20:13:49,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878511600] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:49,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:49,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:49,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069631983] [2021-08-25 20:13:49,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:49,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:49,107 INFO L87 Difference]: Start difference. First operand 4375 states and 6241 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:49,211 INFO L93 Difference]: Finished difference Result 12473 states and 17760 transitions. [2021-08-25 20:13:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 289 [2021-08-25 20:13:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:49,223 INFO L225 Difference]: With dead ends: 12473 [2021-08-25 20:13:49,223 INFO L226 Difference]: Without dead ends: 8106 [2021-08-25 20:13:49,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8106 states. [2021-08-25 20:13:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8106 to 8104. [2021-08-25 20:13:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8104 states, 8103 states have (on average 1.4198445020362829) internal successors, (11505), 8103 states have internal predecessors, (11505), 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:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8104 states to 8104 states and 11505 transitions. [2021-08-25 20:13:49,426 INFO L78 Accepts]: Start accepts. Automaton has 8104 states and 11505 transitions. Word has length 289 [2021-08-25 20:13:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:49,427 INFO L470 AbstractCegarLoop]: Abstraction has 8104 states and 11505 transitions. [2021-08-25 20:13:49,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8104 states and 11505 transitions. [2021-08-25 20:13:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-08-25 20:13:49,440 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:49,440 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:49,460 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:49,656 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,SelfDestructingSolverStorable34 [2021-08-25 20:13:49,657 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash -230809875, now seen corresponding path program 1 times [2021-08-25 20:13:49,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:49,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338230481] [2021-08-25 20:13:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:49,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-08-25 20:13:49,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:49,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338230481] [2021-08-25 20:13:49,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338230481] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:49,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369982163] [2021-08-25 20:13:49,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:49,701 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:49,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:49,702 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:49,704 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:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:49,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:49,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-08-25 20:13:50,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369982163] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:50,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:50,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:50,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866005433] [2021-08-25 20:13:50,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:50,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:50,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:50,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:50,594 INFO L87 Difference]: Start difference. First operand 8104 states and 11505 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:51,041 INFO L93 Difference]: Finished difference Result 24736 states and 34824 transitions. [2021-08-25 20:13:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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 289 [2021-08-25 20:13:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:51,066 INFO L225 Difference]: With dead ends: 24736 [2021-08-25 20:13:51,067 INFO L226 Difference]: Without dead ends: 16140 [2021-08-25 20:13:51,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16140 states. [2021-08-25 20:13:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16140 to 8763. [2021-08-25 20:13:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8763 states, 8762 states have (on average 1.3946587537091988) internal successors, (12220), 8762 states have internal predecessors, (12220), 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:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8763 states to 8763 states and 12220 transitions. [2021-08-25 20:13:51,325 INFO L78 Accepts]: Start accepts. Automaton has 8763 states and 12220 transitions. Word has length 289 [2021-08-25 20:13:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:51,326 INFO L470 AbstractCegarLoop]: Abstraction has 8763 states and 12220 transitions. [2021-08-25 20:13:51,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8763 states and 12220 transitions. [2021-08-25 20:13:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-08-25 20:13:51,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:51,335 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 1, 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:51,353 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:51,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:51,553 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash -947903949, now seen corresponding path program 1 times [2021-08-25 20:13:51,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:51,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118458946] [2021-08-25 20:13:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:51,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2021-08-25 20:13:51,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:51,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118458946] [2021-08-25 20:13:51,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118458946] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:51,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818273535] [2021-08-25 20:13:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:51,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:51,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:51,598 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:51,635 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:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:52,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:52,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2021-08-25 20:13:52,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818273535] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:52,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:52,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:52,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215710719] [2021-08-25 20:13:52,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:52,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:52,610 INFO L87 Difference]: Start difference. First operand 8763 states and 12220 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:52,947 INFO L93 Difference]: Finished difference Result 19624 states and 27198 transitions. [2021-08-25 20:13:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:52,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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 298 [2021-08-25 20:13:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:52,966 INFO L225 Difference]: With dead ends: 19624 [2021-08-25 20:13:52,966 INFO L226 Difference]: Without dead ends: 10662 [2021-08-25 20:13:52,975 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2021-08-25 20:13:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 7885. [2021-08-25 20:13:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7885 states, 7884 states have (on average 1.3684677828513445) internal successors, (10789), 7884 states have internal predecessors, (10789), 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:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7885 states to 7885 states and 10789 transitions. [2021-08-25 20:13:53,210 INFO L78 Accepts]: Start accepts. Automaton has 7885 states and 10789 transitions. Word has length 298 [2021-08-25 20:13:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:53,210 INFO L470 AbstractCegarLoop]: Abstraction has 7885 states and 10789 transitions. [2021-08-25 20:13:53,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7885 states and 10789 transitions. [2021-08-25 20:13:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2021-08-25 20:13:53,219 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:53,220 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 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, 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] [2021-08-25 20:13:53,253 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:53,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-08-25 20:13:53,453 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:53,454 INFO L82 PathProgramCache]: Analyzing trace with hash -187636111, now seen corresponding path program 1 times [2021-08-25 20:13:53,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:53,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353008766] [2021-08-25 20:13:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:53,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-08-25 20:13:53,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:53,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353008766] [2021-08-25 20:13:53,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353008766] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:53,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020535219] [2021-08-25 20:13:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:53,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:53,517 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:53,576 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:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:54,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:54,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-08-25 20:13:54,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020535219] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:54,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:54,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:54,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599051973] [2021-08-25 20:13:54,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:54,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:54,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:54,768 INFO L87 Difference]: Start difference. First operand 7885 states and 10789 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:55,171 INFO L93 Difference]: Finished difference Result 17128 states and 23313 transitions. [2021-08-25 20:13:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 319 [2021-08-25 20:13:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:55,185 INFO L225 Difference]: With dead ends: 17128 [2021-08-25 20:13:55,186 INFO L226 Difference]: Without dead ends: 9251 [2021-08-25 20:13:55,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9251 states. [2021-08-25 20:13:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9251 to 5839. [2021-08-25 20:13:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5839 states, 5838 states have (on average 1.3054128126070572) internal successors, (7621), 5838 states have internal predecessors, (7621), 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:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5839 states to 5839 states and 7621 transitions. [2021-08-25 20:13:55,353 INFO L78 Accepts]: Start accepts. Automaton has 5839 states and 7621 transitions. Word has length 319 [2021-08-25 20:13:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:55,353 INFO L470 AbstractCegarLoop]: Abstraction has 5839 states and 7621 transitions. [2021-08-25 20:13:55,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5839 states and 7621 transitions. [2021-08-25 20:13:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2021-08-25 20:13:55,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:55,363 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 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, 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] [2021-08-25 20:13:55,383 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:55,576 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,SelfDestructingSolverStorable37 [2021-08-25 20:13:55,577 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1177593648, now seen corresponding path program 1 times [2021-08-25 20:13:55,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:55,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148738928] [2021-08-25 20:13:55,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:55,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2021-08-25 20:13:55,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:55,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148738928] [2021-08-25 20:13:55,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148738928] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:55,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:55,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:55,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579313569] [2021-08-25 20:13:55,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:55,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:55,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:55,619 INFO L87 Difference]: Start difference. First operand 5839 states and 7621 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:55,776 INFO L93 Difference]: Finished difference Result 11554 states and 15104 transitions. [2021-08-25 20:13:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 373 [2021-08-25 20:13:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:55,782 INFO L225 Difference]: With dead ends: 11554 [2021-08-25 20:13:55,782 INFO L226 Difference]: Without dead ends: 5257 [2021-08-25 20:13:55,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2021-08-25 20:13:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5027. [2021-08-25 20:13:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5027 states, 5026 states have (on average 1.3010346199761242) internal successors, (6539), 5026 states have internal predecessors, (6539), 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:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6539 transitions. [2021-08-25 20:13:55,879 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6539 transitions. Word has length 373 [2021-08-25 20:13:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:55,879 INFO L470 AbstractCegarLoop]: Abstraction has 5027 states and 6539 transitions. [2021-08-25 20:13:55,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6539 transitions. [2021-08-25 20:13:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2021-08-25 20:13:55,885 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:55,886 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:13:55,886 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1448471752, now seen corresponding path program 1 times [2021-08-25 20:13:55,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:55,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768895286] [2021-08-25 20:13:55,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:55,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 877 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2021-08-25 20:13:55,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:55,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768895286] [2021-08-25 20:13:55,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768895286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:55,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:55,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:55,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157671568] [2021-08-25 20:13:55,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:55,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:55,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:55,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:55,935 INFO L87 Difference]: Start difference. First operand 5027 states and 6539 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:56,005 INFO L93 Difference]: Finished difference Result 8998 states and 11685 transitions. [2021-08-25 20:13:56,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:56,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 375 [2021-08-25 20:13:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:56,011 INFO L225 Difference]: With dead ends: 8998 [2021-08-25 20:13:56,011 INFO L226 Difference]: Without dead ends: 4568 [2021-08-25 20:13:56,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2021-08-25 20:13:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 4308. [2021-08-25 20:13:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4308 states, 4307 states have (on average 1.3013698630136987) internal successors, (5605), 4307 states have internal predecessors, (5605), 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:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4308 states to 4308 states and 5605 transitions. [2021-08-25 20:13:56,085 INFO L78 Accepts]: Start accepts. Automaton has 4308 states and 5605 transitions. Word has length 375 [2021-08-25 20:13:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:56,085 INFO L470 AbstractCegarLoop]: Abstraction has 4308 states and 5605 transitions. [2021-08-25 20:13:56,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4308 states and 5605 transitions. [2021-08-25 20:13:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2021-08-25 20:13:56,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:56,090 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 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, 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:56,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:13:56,090 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:56,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1769991755, now seen corresponding path program 1 times [2021-08-25 20:13:56,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:56,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404619853] [2021-08-25 20:13:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:56,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2021-08-25 20:13:56,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:56,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404619853] [2021-08-25 20:13:56,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404619853] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:56,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813861988] [2021-08-25 20:13:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:56,140 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:56,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:56,157 INFO L229 MonitoredProcess]: Starting monitored process 7 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:56,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-25 20:13:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:56,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:56,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2021-08-25 20:13:57,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813861988] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:57,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:57,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:57,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548929370] [2021-08-25 20:13:57,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:57,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:57,724 INFO L87 Difference]: Start difference. First operand 4308 states and 5605 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:57,924 INFO L93 Difference]: Finished difference Result 7643 states and 9964 transitions. [2021-08-25 20:13:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:13:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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 422 [2021-08-25 20:13:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:57,928 INFO L225 Difference]: With dead ends: 7643 [2021-08-25 20:13:57,928 INFO L226 Difference]: Without dead ends: 2397 [2021-08-25 20:13:57,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2021-08-25 20:13:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2192. [2021-08-25 20:13:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2191 states have (on average 1.3026015518028298) internal successors, (2854), 2191 states have internal predecessors, (2854), 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:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2854 transitions. [2021-08-25 20:13:57,980 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2854 transitions. Word has length 422 [2021-08-25 20:13:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:57,981 INFO L470 AbstractCegarLoop]: Abstraction has 2192 states and 2854 transitions. [2021-08-25 20:13:57,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2854 transitions. [2021-08-25 20:13:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2021-08-25 20:13:57,984 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:57,985 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 5, 4, 4, 3, 3, 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, 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:58,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:58,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:58,209 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash 453064076, now seen corresponding path program 1 times [2021-08-25 20:13:58,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:58,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683933356] [2021-08-25 20:13:58,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:58,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2286 backedges. 1040 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2021-08-25 20:13:58,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:58,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683933356] [2021-08-25 20:13:58,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683933356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:58,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:58,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:58,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192114500] [2021-08-25 20:13:58,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:58,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:58,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:58,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:58,278 INFO L87 Difference]: Start difference. First operand 2192 states and 2854 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:58,417 INFO L93 Difference]: Finished difference Result 3983 states and 5174 transitions. [2021-08-25 20:13:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 450 [2021-08-25 20:13:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:58,419 INFO L225 Difference]: With dead ends: 3983 [2021-08-25 20:13:58,419 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:13:58,421 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:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:13:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:13:58,421 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:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:13:58,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 450 [2021-08-25 20:13:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:58,422 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:13:58,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:13:58,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:13:58,425 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:13:58,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-25 20:13:58,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:13:58,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:58,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:58,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:58,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:58,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:58,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:58,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:58,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:59,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:01,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:03,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:26,478 WARN L207 SmtUtils]: Spent 9.83 s on a formula simplification. DAG size of input: 544 DAG size of output: 127 [2021-08-25 20:14:40,336 WARN L207 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 544 DAG size of output: 127 [2021-08-25 20:14:40,340 INFO L857 garLoopResultBuilder]: For program point L597(lines 597 613) no Hoare annotation was computed. [2021-08-25 20:14:40,340 INFO L857 garLoopResultBuilder]: For program point L598(lines 598 612) no Hoare annotation was computed. [2021-08-25 20:14:40,340 INFO L857 garLoopResultBuilder]: For program point L334(lines 334 375) no Hoare annotation was computed. [2021-08-25 20:14:40,340 INFO L857 garLoopResultBuilder]: For program point L202(lines 202 563) no Hoare annotation was computed. [2021-08-25 20:14:40,340 INFO L857 garLoopResultBuilder]: For program point L169(lines 169 574) no Hoare annotation was computed. [2021-08-25 20:14:40,340 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 585) no Hoare annotation was computed. [2021-08-25 20:14:40,340 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 596) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L599(lines 599 604) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L599-2(lines 598 612) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L467(lines 467 469) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L853 garLoopResultBuilder]: At program point L203(lines 199 564) 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 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse22 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse16 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-08-25 20:14:40,341 INFO L853 garLoopResultBuilder]: At program point L104(lines 103 596) the Hoare annotation is: false [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L501(lines 501 504) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L601(lines 601 603) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L436-1(lines 436 444) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L337(lines 337 374) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L337-1(lines 337 374) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L205(lines 205 562) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 573) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 584) no Hoare annotation was computed. [2021-08-25 20:14:40,341 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 595) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L853 garLoopResultBuilder]: At program point L404(lines 395 416) 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 (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L338(lines 338 371) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L305(lines 305 315) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L305-2(lines 305 315) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L853 garLoopResultBuilder]: At program point L206(lines 205 562) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2021-08-25 20:14:40,342 INFO L853 garLoopResultBuilder]: At program point L173(lines 169 574) the Hoare annotation is: (let ((.cse19 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse12 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse17 .cse18))) [2021-08-25 20:14:40,342 INFO L853 garLoopResultBuilder]: At program point L140(lines 136 585) the Hoare annotation is: (let ((.cse12 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.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 (= 8513 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 8529))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L537(lines 537 541) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L537-2(lines 537 541) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 442) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L853 garLoopResultBuilder]: At program point L208(lines 207 562) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 572) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L142(lines 142 583) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 594) no Hoare annotation was computed. [2021-08-25 20:14:40,342 INFO L860 garLoopResultBuilder]: At program point L638(lines 629 640) the Hoare annotation is: true [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L506(lines 506 516) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L407(lines 407 409) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L275(lines 275 277) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L275-2(lines 209 559) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L606(lines 606 610) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L309(lines 309 311) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L309-2(lines 307 315) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 369) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 254) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 571) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L145(lines 145 582) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 593) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L509(lines 509 515) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L476(lines 476 478) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L857 garLoopResultBuilder]: For program point L245(lines 245 248) no Hoare annotation was computed. [2021-08-25 20:14:40,343 INFO L853 garLoopResultBuilder]: At program point L212(lines 106 595) the Hoare annotation is: (let ((.cse25 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse24 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse22 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse16 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (let ((.cse18 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23 .cse20)))) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse0 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse14 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse15 .cse16 .cse17 .cse19 .cse23 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse19 .cse23 .cse20) (and .cse1 .cse2 .cse26 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse27 (not .cse22) .cse14 .cse25 .cse15 .cse16 .cse17 .cse19 .cse23 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse0 .cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse14 .cse15 .cse16 .cse17 .cse19 .cse23 .cse20) (and .cse0 (let ((.cse28 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse23 .cse20)))) (and .cse1 .cse2 .cse26 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse23 .cse20 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,344 INFO L853 garLoopResultBuilder]: At program point L179(lines 175 572) the Hoare annotation is: (let ((.cse6 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse19 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,344 INFO L853 garLoopResultBuilder]: At program point L146(lines 142 583) the Hoare annotation is: (let ((.cse13 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.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 (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12))) [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L346-2(lines 346 350) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 570) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 581) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L115(lines 115 592) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L512(lines 512 514) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L512-2(lines 209 559) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L547(lines 547 553) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L547-1(lines 547 553) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 569) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 580) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L118(lines 118 591) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point L383(lines 383 418) no Hoare annotation was computed. [2021-08-25 20:14:40,344 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L853 garLoopResultBuilder]: At program point L185(lines 181 570) the Hoare annotation is: (let ((.cse17 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse18 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse14 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse15 .cse16))) [2021-08-25 20:14:40,345 INFO L853 garLoopResultBuilder]: At program point L152(lines 148 581) 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))) (.cse13 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse10 .cse11 .cse12))) [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 88) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L384(lines 384 390) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L860 garLoopResultBuilder]: At program point L616(lines 99 617) the Hoare annotation is: true [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L550(lines 550 552) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 568) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 579) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L121(lines 121 590) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L485(lines 485 487) no Hoare annotation was computed. [2021-08-25 20:14:40,345 INFO L853 garLoopResultBuilder]: At program point L122(lines 118 591) 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 (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,345 INFO L853 garLoopResultBuilder]: At program point L486(lines 73 627) the Hoare annotation is: false [2021-08-25 20:14:40,345 INFO L857 garLoopResultBuilder]: For program point L453(lines 453 462) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 365) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 290) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L288-2(lines 209 559) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L853 garLoopResultBuilder]: At program point L355(lines 331 376) 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))) (.cse13 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse10 .cse11 .cse12))) [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 567) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L157(lines 157 578) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 589) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 73 627) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L488(lines 488 490) no Hoare annotation was computed. [2021-08-25 20:14:40,346 INFO L853 garLoopResultBuilder]: At program point L191(lines 187 568) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse0 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse4) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse3 (not .cse1) .cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse4) (and .cse2 .cse4 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse2 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse2 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,346 INFO L853 garLoopResultBuilder]: At program point L158(lines 154 579) 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 (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,346 INFO L853 garLoopResultBuilder]: At program point L125(lines 124 589) the Hoare annotation is: (let ((.cse9 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.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 (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse13 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse14) (and .cse0 .cse1 .cse2 .cse3 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14))) [2021-08-25 20:14:40,346 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 94) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L621(lines 621 623) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L621-2(lines 621 623) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L522(lines 522 525) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L357(lines 357 359) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L357-2(lines 354 363) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L457(lines 457 459) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L325-2(lines 209 559) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L193(lines 193 566) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L160(lines 160 577) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L127(lines 127 588) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L491(lines 491 495) no Hoare annotation was computed. [2021-08-25 20:14:40,347 INFO L857 garLoopResultBuilder]: For program point L491-2(lines 491 495) no Hoare annotation was computed. [2021-08-25 20:14:40,349 INFO L853 garLoopResultBuilder]: At program point L392(lines 383 418) 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 (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,349 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 262) no Hoare annotation was computed. [2021-08-25 20:14:40,349 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 238) no Hoare annotation was computed. [2021-08-25 20:14:40,349 INFO L857 garLoopResultBuilder]: For program point L227-2(lines 209 559) no Hoare annotation was computed. [2021-08-25 20:14:40,349 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:14:40,349 INFO L857 garLoopResultBuilder]: For program point L294-2(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:14:40,350 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 232) no Hoare annotation was computed. [2021-08-25 20:14:40,350 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 565) no Hoare annotation was computed. [2021-08-25 20:14:40,350 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 576) no Hoare annotation was computed. [2021-08-25 20:14:40,350 INFO L857 garLoopResultBuilder]: For program point L130(lines 130 587) no Hoare annotation was computed. [2021-08-25 20:14:40,350 INFO L860 garLoopResultBuilder]: At program point L626(lines 12 628) the Hoare annotation is: true [2021-08-25 20:14:40,350 INFO L853 garLoopResultBuilder]: At program point L560(lines 100 615) the Hoare annotation is: (let ((.cse27 (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse37 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse30 (not .cse21)) (.cse28 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse32 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse33 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse20 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse25 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse34 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse22 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse35 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not .cse37)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse8 (not .cse24)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not .cse27)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse36 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse14 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse31 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse38 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse10 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse22 .cse21 .cse23 .cse24) (and .cse25 .cse21 .cse26 .cse27) (and .cse28 .cse21 .cse17 .cse18 .cse19) (and .cse7 .cse26 .cse29 .cse30 .cse18 .cse31) (and .cse32 .cse16 .cse33 .cse30 .cse18 .cse10 .cse19) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse5 .cse6 .cse21 .cse17 .cse29 .cse9 .cse23 .cse12 .cse13 .cse14 .cse19) (and .cse26 .cse29 .cse30 .cse27 .cse31) (and .cse0 .cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse34 .cse21 .cse35 .cse20) (and .cse0 .cse1 .cse32 .cse2 .cse3 .cse5 .cse6 .cse21 .cse33 .cse9 .cse12 .cse13 .cse14 .cse19 .cse20) (and .cse21 .cse17 .cse18 .cse36 .cse19) (and .cse22 .cse37 .cse21 .cse23) (and .cse34 .cse21 .cse35 .cse10) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse22 .cse21 .cse17 .cse29 .cse18 .cse19) (and .cse32 .cse33 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse5 .cse6 .cse21 .cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse9 .cse12 .cse13 .cse14 .cse19) (and .cse22 .cse25 .cse21 .cse27) (and .cse34 .cse22 .cse21 .cse35 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15) (and .cse21 .cse29 .cse38) (and .cse26 .cse29 .cse31 .cse38)))) [2021-08-25 20:14:40,350 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 430) no Hoare annotation was computed. [2021-08-25 20:14:40,350 INFO L857 garLoopResultBuilder]: For program point L395(lines 395 416) no Hoare annotation was computed. [2021-08-25 20:14:40,351 INFO L853 garLoopResultBuilder]: At program point L197(lines 193 566) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse3 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 .cse2 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5) (and .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse8 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5))) [2021-08-25 20:14:40,351 INFO L853 garLoopResultBuilder]: At program point L164(lines 160 577) 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 (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-08-25 20:14:40,351 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:14:40,351 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 625) no Hoare annotation was computed. [2021-08-25 20:14:40,351 INFO L857 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2021-08-25 20:14:40,351 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 564) no Hoare annotation was computed. [2021-08-25 20:14:40,351 INFO L857 garLoopResultBuilder]: For program point L166(lines 166 575) no Hoare annotation was computed. [2021-08-25 20:14:40,352 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 586) no Hoare annotation was computed. [2021-08-25 20:14:40,352 INFO L853 garLoopResultBuilder]: At program point L100-2(lines 100 615) the Hoare annotation is: (let ((.cse27 (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse37 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse30 (not .cse21)) (.cse28 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse32 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse33 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse20 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse25 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse34 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse22 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse35 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not .cse37)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse8 (not .cse24)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not .cse27)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse36 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse14 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse31 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse38 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse10 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse22 .cse21 .cse23 .cse24) (and .cse25 .cse21 .cse26 .cse27) (and .cse28 .cse21 .cse17 .cse18 .cse19) (and .cse7 .cse26 .cse29 .cse30 .cse18 .cse31) (and .cse32 .cse16 .cse33 .cse30 .cse18 .cse10 .cse19) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse5 .cse6 .cse21 .cse17 .cse29 .cse9 .cse23 .cse12 .cse13 .cse14 .cse19) (and .cse26 .cse29 .cse30 .cse27 .cse31) (and .cse0 .cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse34 .cse21 .cse35 .cse20) (and .cse0 .cse1 .cse32 .cse2 .cse3 .cse5 .cse6 .cse21 .cse33 .cse9 .cse12 .cse13 .cse14 .cse19 .cse20) (and .cse21 .cse17 .cse18 .cse36 .cse19) (and .cse22 .cse37 .cse21 .cse23) (and .cse34 .cse21 .cse35 .cse10) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse22 .cse21 .cse17 .cse29 .cse18 .cse19) (and .cse32 .cse33 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse5 .cse6 .cse21 .cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse9 .cse12 .cse13 .cse14 .cse19) (and .cse22 .cse25 .cse21 .cse27) (and .cse34 .cse22 .cse21 .cse35 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15) (and .cse21 .cse29 .cse38) (and .cse26 .cse29 .cse31 .cse38)))) [2021-08-25 20:14:40,352 INFO L857 garLoopResultBuilder]: For program point L530(lines 530 532) no Hoare annotation was computed. [2021-08-25 20:14:40,352 INFO L857 garLoopResultBuilder]: For program point L530-2(lines 209 559) no Hoare annotation was computed. [2021-08-25 20:14:40,352 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 236) no Hoare annotation was computed. [2021-08-25 20:14:40,352 INFO L853 garLoopResultBuilder]: At program point L167(lines 166 575) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse5 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse2 (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse3 .cse0 .cse4 .cse2) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse0) .cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 .cse2 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse5 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse2) (and .cse5 .cse3 .cse0 .cse2))) [2021-08-25 20:14:40,352 INFO L853 garLoopResultBuilder]: At program point L134(lines 127 588) the Hoare annotation is: (let ((.cse14 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse15 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.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 (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13))) [2021-08-25 20:14:40,353 INFO L857 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2021-08-25 20:14:40,355 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:14:40,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:14:40 BoogieIcfgContainer [2021-08-25 20:14:40,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:14:40,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:14:40,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:14:40,399 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:14:40,400 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:39" (3/4) ... [2021-08-25 20:14:40,402 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:14:40,414 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:14:40,415 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:14:40,416 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:14:40,416 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:14:40,482 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:14:40,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:14:40,483 INFO L168 Benchmark]: Toolchain (without parser) took 62372.81 ms. Allocated memory was 56.6 MB in the beginning and 1.5 GB in the end (delta: 1.5 GB). Free memory was 35.3 MB in the beginning and 640.2 MB in the end (delta: -604.9 MB). Peak memory consumption was 854.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:40,483 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.6 MB in the beginning and 38.6 MB in the end (delta: 38.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:14:40,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.06 ms. Allocated memory is still 56.6 MB. Free memory was 35.1 MB in the beginning and 37.1 MB in the end (delta: -2.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:40,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 56.6 MB. Free memory was 37.1 MB in the beginning and 34.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:40,484 INFO L168 Benchmark]: Boogie Preprocessor took 38.55 ms. Allocated memory is still 56.6 MB. Free memory was 34.2 MB in the beginning and 32.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:40,484 INFO L168 Benchmark]: RCFGBuilder took 603.27 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 32.1 MB in the beginning and 51.5 MB in the end (delta: -19.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:40,485 INFO L168 Benchmark]: TraceAbstraction took 61104.39 ms. Allocated memory was 73.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 50.8 MB in the beginning and 658.2 MB in the end (delta: -607.4 MB). Peak memory consumption was 923.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:40,485 INFO L168 Benchmark]: Witness Printer took 83.37 ms. Allocated memory is still 1.5 GB. Free memory was 658.2 MB in the beginning and 640.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:40,486 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.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.6 MB in the beginning and 38.6 MB in the end (delta: 38.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 465.06 ms. Allocated memory is still 56.6 MB. Free memory was 35.1 MB in the beginning and 37.1 MB in the end (delta: -2.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 56.6 MB. Free memory was 37.1 MB in the beginning and 34.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.55 ms. Allocated memory is still 56.6 MB. Free memory was 34.2 MB in the beginning and 32.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 603.27 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 32.1 MB in the beginning and 51.5 MB in the end (delta: -19.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 61104.39 ms. Allocated memory was 73.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 50.8 MB in the beginning and 658.2 MB in the end (delta: -607.4 MB). Peak memory consumption was 923.6 MB. Max. memory is 16.1 GB. * Witness Printer took 83.37 ms. Allocated memory is still 1.5 GB. Free memory was 658.2 MB in the beginning and 640.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.9 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: 625]: 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, 146 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61026.2ms, OverallIterations: 42, TraceHistogramMax: 17, EmptinessCheckTime: 141.9ms, AutomataDifference: 6888.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 41914.6ms, InitialAbstractionConstructionTime: 8.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 8478 SDtfs, 6034 SDslu, 3997 SDs, 0 SdLazy, 3772 SolverSat, 1267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3248.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1934 GetRequests, 1880 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 133.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8763occurred in iteration=36, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2390.9ms AutomataMinimizationTime, 42 MinimizatonAttempts, 14961 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 368 NumberOfFragments, 7127 HoareAnnotationTreeSize, 28 FomulaSimplifications, 486252 FormulaSimplificationTreeSizeReduction, 5151.1ms HoareSimplificationTime, 28 FomulaSimplificationsInter, 201661 FormulaSimplificationTreeSizeReductionInter, 36733.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 224.5ms SsaConstructionTime, 701.4ms SatisfiabilityAnalysisTime, 5199.3ms InterpolantComputationTime, 8290 NumberOfCodeBlocks, 8290 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 8242 ConstructedInterpolants, 0 QuantifiedInterpolants, 12945 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3178 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 48 InterpolantComputations, 38 PerfectInterpolantSequences, 20625/20857 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: 629]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && !(s__state == 8512)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && ((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag == 1) && !(8593 == s__state)) && !(s__state == 8512)) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag == 1) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)))) || ((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8672) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8672) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8672) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || (s__state <= 8672 && ((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))))) || ((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8544) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8673) && !(s__state == 8672)) && !(s__state == 8640)) && !(12292 == s__state)) && 8640 <= s__state) && !(s__state == 8641)) && 3 == blastFlag) || (((((((!(s__state == 8672) && !(s__state == 8640)) && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__state == 8641))) || ((((((!(s__state == 8673) && !(s__state == 8672)) && !(s__state == 8640)) && !(12292 == s__state)) && 8640 <= s__state) && 2 == blastFlag) && !(s__state == 8641))) || ((((((!(s__state == 8672) && !(s__state == 8640)) && blastFlag == 0) && s__hit == 0) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8641))) || (((((((!(s__state == 8672) && !(s__state == 8640)) && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672) && blastFlag <= 6) && 8640 <= s__state) && !(s__state == 8641))) || ((((((!(s__state == 8672) && !(s__state == 8640)) && s__hit == 0) && s__state <= 8672) && 8640 <= s__state) && blastFlag == 1) && !(s__state == 8641)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((((6 <= blastFlag && s__hit == 0) && s__state <= 8640) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && blastFlag <= 7) || ((blastFlag == 0 && s__state <= 8640) && 8640 <= s__state)) || (((((s__state <= 8640 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((6 <= blastFlag && s__hit == 0) && s__state <= 8640) && blastFlag <= 6) && 8640 <= s__state)) || ((s__state <= 8640 && 8640 <= s__state) && 3 == blastFlag)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8640 && 8640 <= s__state) && 2 == blastFlag) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag == 1) && !(s__state == 8512))) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag == 1) && !(s__state == 8512))) || (((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) - 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)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && 3 == blastFlag) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state))) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(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__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && 8448 == s__state) || (((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 4) && 8448 == s__state)) || ((((blastFlag <= 4 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8448 == s__state) && 8640 <= s__s3__tmp__next_state___0)) || (((s__hit == 0 && s__s3__tmp__next_state___0 <= 8576) && 8448 == s__state) && 3 == blastFlag)) || ((((6 <= blastFlag && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 7) && 8448 == s__state)) || (((6 <= blastFlag && s__s3__tmp__next_state___0 <= 3) && s__hit == 0) && 8448 == s__state) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) || ((((!(s__state == 8672) && s__state <= 8672) && 8640 <= s__state) && 2 == blastFlag) && !(s__state == 8641))) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state))) || (((6 <= blastFlag && s__hit == 0) && blastFlag <= 7) && 8560 == s__state)) || (((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 4) && 8448 == s__state)) || ((((blastFlag == 0 && s__hit == 0) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8641))) || (((((s__state <= 8640 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((((!(s__state == 8673) && !(s__state == 8672)) && !(12292 == s__state)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag) && !(s__state == 8641))) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641))) || ((((blastFlag <= 4 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8448 == s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512))) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 3 == blastFlag)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(12292 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && 3 == blastFlag)) || ((((s__hit == 0 && s__state <= 8672) && 8640 <= s__state) && blastFlag == 1) && !(s__state == 8641))) || (((6 <= blastFlag && s__state == 8544) && s__hit == 0) && blastFlag <= 7)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((((!(s__state == 8640) && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__state == 8641))) || ((((!(s__state == 8673) && !(12292 == s__state)) && 8640 <= s__state) && !(s__state == 8641)) && 3 == blastFlag)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8672) && blastFlag <= 6) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641))) || (((6 <= blastFlag && s__s3__tmp__next_state___0 <= 3) && s__hit == 0) && 8448 == s__state)) || ((((s__state <= 8576 && 6 <= blastFlag) && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 7)) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag == 1) && !(8593 == s__state)) && !(s__state == 8512))) || ((s__hit == 0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 3)) || (((blastFlag <= 4 && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__s3__tmp__next_state___0) && s__state <= 3) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag == 1) && !(s__state == 8512)) || ((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || (((((((((((((((!(s__state == 8480) && s__state <= 8576) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((!(s__state == 8480) && s__state <= 8576) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512))) || (((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || ((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512))) || (((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512))) || (((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag == 1) && !(8593 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(12292 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8641)) && !(s__state == 8512)) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8641)) && !(s__state == 8512))) || ((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(12292 == s__state)) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag == 1) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8641)) && !(s__state == 8512)) && 3 == blastFlag) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && 8640 <= s__state) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) && 3 == blastFlag) || ((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && 8640 <= s__state) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag == 1) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(12292 == s__state)) && !(s__state == 8545)) && 8640 <= s__state) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || ((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__state == 8545)) && 8640 <= s__state) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512))) || (((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(8560 == s__state)) && !(12292 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && 8640 <= s__state) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(8593 == s__state)) && !(s__state == 8512)) || (((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(8593 == s__state)) && !(s__state == 8512))) || (((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(8593 == s__state)) && !(s__state == 8512))) || ((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(s__state == 8528)) && !(8448 == s__state)) && !(8593 == s__state)) && !(s__state == 8512))) || (((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(8593 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || (((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag == 1) && !(8593 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && !(s__state == 8512)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(8448 == s__state)) && !(s__state == 8512))) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && blastFlag <= 6) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) || ((((!(s__state == 8672) && s__state <= 8672) && 8640 <= s__state) && 2 == blastFlag) && !(s__state == 8641))) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) && 3 == blastFlag)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state))) || (((6 <= blastFlag && s__hit == 0) && blastFlag <= 7) && 8560 == s__state)) || (((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 4) && 8448 == s__state)) || ((((blastFlag == 0 && s__hit == 0) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8641))) || (((((s__state <= 8640 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((((!(s__state == 8673) && !(s__state == 8672)) && !(12292 == s__state)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag) && !(s__state == 8641))) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && blastFlag <= 7) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641))) || ((((blastFlag <= 4 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8448 == s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512))) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 3 == blastFlag)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && !(12292 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && 3 == blastFlag)) || ((((s__hit == 0 && s__state <= 8672) && 8640 <= s__state) && blastFlag == 1) && !(s__state == 8641))) || (((6 <= blastFlag && s__state == 8544) && s__hit == 0) && blastFlag <= 7)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((((!(s__state == 8640) && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__state == 8641))) || ((((!(s__state == 8673) && !(12292 == s__state)) && 8640 <= s__state) && !(s__state == 8641)) && 3 == blastFlag)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && 6 <= blastFlag) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && s__hit == 0) && s__state <= 8672) && blastFlag <= 6) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641))) || (((6 <= blastFlag && s__s3__tmp__next_state___0 <= 3) && s__hit == 0) && 8448 == s__state)) || ((((s__state <= 8576 && 6 <= blastFlag) && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 7)) || (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag == 1) && !(8593 == s__state)) && !(s__state == 8512))) || ((s__hit == 0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 3)) || (((blastFlag <= 4 && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__s3__tmp__next_state___0) && s__state <= 3) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8544) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:14:40,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...