./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_2.cil-1.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 dca428a91d61f16d984f5dd6898f66ec80371948e14839543a0c63f73de1fec4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:56:36,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:56:36,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:56:37,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:56:37,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:56:37,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:56:37,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:56:37,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:56:37,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:56:37,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:56:37,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:56:37,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:56:37,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:56:37,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:56:37,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:56:37,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:56:37,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:56:37,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:56:37,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:56:37,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:56:37,065 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:56:37,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:56:37,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:56:37,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:56:37,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:56:37,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:56:37,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:56:37,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:56:37,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:56:37,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:56:37,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:56:37,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:56:37,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:56:37,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:56:37,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:56:37,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:56:37,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:56:37,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:56:37,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:56:37,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:56:37,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:56:37,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:56:37,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:56:37,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:56:37,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:56:37,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:56:37,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:56:37,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:56:37,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:56:37,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:56:37,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:56:37,100 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:56:37,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:56:37,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:56:37,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:56:37,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:56:37,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:56:37,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:56:37,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:56:37,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:56:37,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:56:37,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:56:37,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:56:37,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:56:37,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:56:37,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:56:37,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:56:37,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:56:37,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:56:37,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:56:37,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:56:37,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:56:37,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:56:37,104 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:56:37,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:56:37,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:56:37,104 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 -> dca428a91d61f16d984f5dd6898f66ec80371948e14839543a0c63f73de1fec4 [2022-07-19 10:56:37,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:56:37,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:56:37,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:56:37,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:56:37,329 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:56:37,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2022-07-19 10:56:37,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e128915/3b5a5848ee4645aea47eedae4c3dde20/FLAG22ea66357 [2022-07-19 10:56:37,714 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:56:37,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-1.c [2022-07-19 10:56:37,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e128915/3b5a5848ee4645aea47eedae4c3dde20/FLAG22ea66357 [2022-07-19 10:56:37,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e128915/3b5a5848ee4645aea47eedae4c3dde20 [2022-07-19 10:56:37,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:56:37,734 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:56:37,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:56:37,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:56:37,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:56:37,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:56:37" (1/1) ... [2022-07-19 10:56:37,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac2c7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:37, skipping insertion in model container [2022-07-19 10:56:37,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:56:37" (1/1) ... [2022-07-19 10:56:37,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:56:37,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:56:37,961 WARN L230 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_2.cil-1.c[42877,42890] [2022-07-19 10:56:37,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:56:37,980 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:56:38,027 WARN L230 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_2.cil-1.c[42877,42890] [2022-07-19 10:56:38,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:56:38,045 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:56:38,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38 WrapperNode [2022-07-19 10:56:38,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:56:38,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:56:38,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:56:38,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:56:38,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,100 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2022-07-19 10:56:38,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:56:38,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:56:38,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:56:38,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:56:38,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:56:38,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:56:38,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:56:38,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:56:38,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (1/1) ... [2022-07-19 10:56:38,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:56:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:38,194 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) [2022-07-19 10:56:38,209 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 [2022-07-19 10:56:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:56:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:56:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:56:38,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:56:38,334 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:56:38,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:56:38,347 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:56:38,822 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 10:56:38,823 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 10:56:38,823 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:56:38,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:56:38,836 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:56:38,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:56:38 BoogieIcfgContainer [2022-07-19 10:56:38,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:56:38,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:56:38,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:56:38,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:56:38,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:56:37" (1/3) ... [2022-07-19 10:56:38,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1999abed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:56:38, skipping insertion in model container [2022-07-19 10:56:38,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:38" (2/3) ... [2022-07-19 10:56:38,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1999abed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:56:38, skipping insertion in model container [2022-07-19 10:56:38,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:56:38" (3/3) ... [2022-07-19 10:56:38,843 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2022-07-19 10:56:38,860 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:56:38,861 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:56:38,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:56:38,916 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fc5059, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28570daf [2022-07-19 10:56:38,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:56:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:56:38,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:38,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:38,928 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:38,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2022-07-19 10:56:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:38,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272081288] [2022-07-19 10:56:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:56:39,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:39,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272081288] [2022-07-19 10:56:39,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272081288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:39,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:39,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008592239] [2022-07-19 10:56:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:39,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:39,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,192 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:39,407 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2022-07-19 10:56:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-19 10:56:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:39,416 INFO L225 Difference]: With dead ends: 328 [2022-07-19 10:56:39,416 INFO L226 Difference]: Without dead ends: 175 [2022-07-19 10:56:39,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,420 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:39,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:56:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-19 10:56:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2022-07-19 10:56:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2022-07-19 10:56:39,450 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2022-07-19 10:56:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:39,451 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2022-07-19 10:56:39,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2022-07-19 10:56:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:56:39,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:39,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:39,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:56:39,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2022-07-19 10:56:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:39,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914310904] [2022-07-19 10:56:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:56:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:39,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914310904] [2022-07-19 10:56:39,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914310904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:39,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:39,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160127660] [2022-07-19 10:56:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:39,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,496 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:39,628 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2022-07-19 10:56:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-19 10:56:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:39,632 INFO L225 Difference]: With dead ends: 380 [2022-07-19 10:56:39,632 INFO L226 Difference]: Without dead ends: 216 [2022-07-19 10:56:39,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,638 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:39,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-19 10:56:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-07-19 10:56:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2022-07-19 10:56:39,658 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2022-07-19 10:56:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:39,659 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2022-07-19 10:56:39,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2022-07-19 10:56:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:56:39,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:39,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:39,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:56:39,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2071968837, now seen corresponding path program 1 times [2022-07-19 10:56:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467245627] [2022-07-19 10:56:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:56:39,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:39,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467245627] [2022-07-19 10:56:39,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467245627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:39,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:39,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:39,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075661929] [2022-07-19 10:56:39,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:39,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:39,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:39,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,755 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:39,856 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2022-07-19 10:56:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-19 10:56:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:39,857 INFO L225 Difference]: With dead ends: 445 [2022-07-19 10:56:39,858 INFO L226 Difference]: Without dead ends: 242 [2022-07-19 10:56:39,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,859 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:39,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-19 10:56:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-19 10:56:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2022-07-19 10:56:39,867 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2022-07-19 10:56:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:39,867 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2022-07-19 10:56:39,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2022-07-19 10:56:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:56:39,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:39,869 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:39,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:56:39,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash -947039589, now seen corresponding path program 1 times [2022-07-19 10:56:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:39,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974338574] [2022-07-19 10:56:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 10:56:39,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:39,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974338574] [2022-07-19 10:56:39,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974338574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:39,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:39,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:39,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390757080] [2022-07-19 10:56:39,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:39,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:39,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:39,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:39,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,918 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:39,994 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2022-07-19 10:56:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:39,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-07-19 10:56:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:39,996 INFO L225 Difference]: With dead ends: 493 [2022-07-19 10:56:39,996 INFO L226 Difference]: Without dead ends: 259 [2022-07-19 10:56:39,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:39,997 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:39,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-19 10:56:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-07-19 10:56:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2022-07-19 10:56:40,010 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2022-07-19 10:56:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,010 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2022-07-19 10:56:40,010 INFO L496 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) [2022-07-19 10:56:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2022-07-19 10:56:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:56:40,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,012 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:40,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:56:40,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1168944985, now seen corresponding path program 1 times [2022-07-19 10:56:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340899725] [2022-07-19 10:56:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:56:40,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340899725] [2022-07-19 10:56:40,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340899725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532135420] [2022-07-19 10:56:40,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,049 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:40,165 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2022-07-19 10:56:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:40,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-07-19 10:56:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:40,167 INFO L225 Difference]: With dead ends: 552 [2022-07-19 10:56:40,167 INFO L226 Difference]: Without dead ends: 303 [2022-07-19 10:56:40,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,168 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:40,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 144 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-19 10:56:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2022-07-19 10:56:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2022-07-19 10:56:40,176 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2022-07-19 10:56:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,176 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2022-07-19 10:56:40,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2022-07-19 10:56:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 10:56:40,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:56:40,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2129818626, now seen corresponding path program 1 times [2022-07-19 10:56:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134484739] [2022-07-19 10:56:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 10:56:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134484739] [2022-07-19 10:56:40,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134484739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158465983] [2022-07-19 10:56:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,206 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:40,278 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2022-07-19 10:56:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-19 10:56:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:40,280 INFO L225 Difference]: With dead ends: 592 [2022-07-19 10:56:40,280 INFO L226 Difference]: Without dead ends: 301 [2022-07-19 10:56:40,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,281 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:40,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-19 10:56:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2022-07-19 10:56:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2022-07-19 10:56:40,287 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2022-07-19 10:56:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,288 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2022-07-19 10:56:40,288 INFO L496 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) [2022-07-19 10:56:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2022-07-19 10:56:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 10:56:40,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:56:40,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -122958423, now seen corresponding path program 1 times [2022-07-19 10:56:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153682075] [2022-07-19 10:56:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:56:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153682075] [2022-07-19 10:56:40,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153682075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500461907] [2022-07-19 10:56:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,316 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:40,422 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2022-07-19 10:56:40,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:40,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-19 10:56:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:40,423 INFO L225 Difference]: With dead ends: 594 [2022-07-19 10:56:40,423 INFO L226 Difference]: Without dead ends: 301 [2022-07-19 10:56:40,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,424 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:40,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 143 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-19 10:56:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2022-07-19 10:56:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2022-07-19 10:56:40,430 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2022-07-19 10:56:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,430 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2022-07-19 10:56:40,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2022-07-19 10:56:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 10:56:40,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:40,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:56:40,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1553184093, now seen corresponding path program 1 times [2022-07-19 10:56:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22446659] [2022-07-19 10:56:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 10:56:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22446659] [2022-07-19 10:56:40,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22446659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952735389] [2022-07-19 10:56:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,453 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:40,517 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2022-07-19 10:56:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:40,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-19 10:56:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:40,518 INFO L225 Difference]: With dead ends: 595 [2022-07-19 10:56:40,518 INFO L226 Difference]: Without dead ends: 306 [2022-07-19 10:56:40,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,519 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:40,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-19 10:56:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-07-19 10:56:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2022-07-19 10:56:40,526 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2022-07-19 10:56:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,526 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2022-07-19 10:56:40,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2022-07-19 10:56:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 10:56:40,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:40,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:56:40,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2083521026, now seen corresponding path program 1 times [2022-07-19 10:56:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104542444] [2022-07-19 10:56:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 10:56:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104542444] [2022-07-19 10:56:40,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104542444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399581617] [2022-07-19 10:56:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,572 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:40,656 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2022-07-19 10:56:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:40,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-19 10:56:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:40,658 INFO L225 Difference]: With dead ends: 635 [2022-07-19 10:56:40,658 INFO L226 Difference]: Without dead ends: 337 [2022-07-19 10:56:40,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,659 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:40,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-19 10:56:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-07-19 10:56:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2022-07-19 10:56:40,666 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2022-07-19 10:56:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,666 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2022-07-19 10:56:40,666 INFO L496 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) [2022-07-19 10:56:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2022-07-19 10:56:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-19 10:56:40,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:40,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:56:40,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash -102460539, now seen corresponding path program 1 times [2022-07-19 10:56:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882565346] [2022-07-19 10:56:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 10:56:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882565346] [2022-07-19 10:56:40,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882565346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317274329] [2022-07-19 10:56:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,689 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:40,775 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2022-07-19 10:56:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-19 10:56:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:40,776 INFO L225 Difference]: With dead ends: 664 [2022-07-19 10:56:40,776 INFO L226 Difference]: Without dead ends: 337 [2022-07-19 10:56:40,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,777 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:40,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-19 10:56:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-07-19 10:56:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2022-07-19 10:56:40,784 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2022-07-19 10:56:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,785 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2022-07-19 10:56:40,785 INFO L496 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) [2022-07-19 10:56:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2022-07-19 10:56:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 10:56:40,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,786 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:56:40,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:56:40,786 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash -651386898, now seen corresponding path program 1 times [2022-07-19 10:56:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449915486] [2022-07-19 10:56:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 10:56:40,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449915486] [2022-07-19 10:56:40,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449915486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484779304] [2022-07-19 10:56:40,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,809 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:40,901 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2022-07-19 10:56:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-19 10:56:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:40,903 INFO L225 Difference]: With dead ends: 697 [2022-07-19 10:56:40,903 INFO L226 Difference]: Without dead ends: 370 [2022-07-19 10:56:40,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,904 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:40,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-19 10:56:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-07-19 10:56:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2022-07-19 10:56:40,912 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2022-07-19 10:56:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:40,912 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2022-07-19 10:56:40,913 INFO L496 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) [2022-07-19 10:56:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2022-07-19 10:56:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 10:56:40,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:40,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:40,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:56:40,914 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1258189035, now seen corresponding path program 1 times [2022-07-19 10:56:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:40,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678025387] [2022-07-19 10:56:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 10:56:40,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:40,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678025387] [2022-07-19 10:56:40,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678025387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:40,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:40,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178403441] [2022-07-19 10:56:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:40,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:40,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:40,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:40,934 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,023 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2022-07-19 10:56:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-19 10:56:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,025 INFO L225 Difference]: With dead ends: 724 [2022-07-19 10:56:41,025 INFO L226 Difference]: Without dead ends: 370 [2022-07-19 10:56:41,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,027 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-19 10:56:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-07-19 10:56:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2022-07-19 10:56:41,051 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2022-07-19 10:56:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:41,052 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2022-07-19 10:56:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2022-07-19 10:56:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 10:56:41,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:41,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:41,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:56:41,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1027805126, now seen corresponding path program 1 times [2022-07-19 10:56:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:41,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051041280] [2022-07-19 10:56:41,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 10:56:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:41,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051041280] [2022-07-19 10:56:41,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051041280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:41,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:41,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:41,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544269409] [2022-07-19 10:56:41,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:41,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:41,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,087 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,169 INFO L93 Difference]: Finished difference Result 742 states and 1195 transitions. [2022-07-19 10:56:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-19 10:56:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,171 INFO L225 Difference]: With dead ends: 742 [2022-07-19 10:56:41,171 INFO L226 Difference]: Without dead ends: 388 [2022-07-19 10:56:41,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,172 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 146 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-19 10:56:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2022-07-19 10:56:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2022-07-19 10:56:41,196 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2022-07-19 10:56:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:41,197 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2022-07-19 10:56:41,197 INFO L496 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) [2022-07-19 10:56:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2022-07-19 10:56:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 10:56:41,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:41,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:41,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:56:41,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1570072403, now seen corresponding path program 1 times [2022-07-19 10:56:41,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:41,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036946383] [2022-07-19 10:56:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 10:56:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:41,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036946383] [2022-07-19 10:56:41,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036946383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:41,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:41,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:41,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908543018] [2022-07-19 10:56:41,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:41,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:41,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:41,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:41,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,246 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,325 INFO L93 Difference]: Finished difference Result 763 states and 1218 transitions. [2022-07-19 10:56:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 10:56:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,326 INFO L225 Difference]: With dead ends: 763 [2022-07-19 10:56:41,326 INFO L226 Difference]: Without dead ends: 388 [2022-07-19 10:56:41,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,343 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 146 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-19 10:56:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2022-07-19 10:56:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2022-07-19 10:56:41,354 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2022-07-19 10:56:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:41,354 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2022-07-19 10:56:41,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2022-07-19 10:56:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 10:56:41,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:41,355 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:41,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:56:41,355 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1383340250, now seen corresponding path program 1 times [2022-07-19 10:56:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:41,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337797932] [2022-07-19 10:56:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 10:56:41,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:41,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337797932] [2022-07-19 10:56:41,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337797932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:41,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:41,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:41,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965403764] [2022-07-19 10:56:41,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:41,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:41,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:41,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:41,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,398 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,426 INFO L93 Difference]: Finished difference Result 1127 states and 1785 transitions. [2022-07-19 10:56:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-19 10:56:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,428 INFO L225 Difference]: With dead ends: 1127 [2022-07-19 10:56:41,428 INFO L226 Difference]: Without dead ends: 752 [2022-07-19 10:56:41,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,431 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 133 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 539 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-19 10:56:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2022-07-19 10:56:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.5805592543275633) internal successors, (1187), 751 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1187 transitions. [2022-07-19 10:56:41,447 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1187 transitions. Word has length 121 [2022-07-19 10:56:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:41,447 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 1187 transitions. [2022-07-19 10:56:41,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1187 transitions. [2022-07-19 10:56:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 10:56:41,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:41,449 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:56:41,449 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash 485946972, now seen corresponding path program 1 times [2022-07-19 10:56:41,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:41,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649432318] [2022-07-19 10:56:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 10:56:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:41,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649432318] [2022-07-19 10:56:41,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649432318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:41,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854742665] [2022-07-19 10:56:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:41,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:41,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:41,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,477 INFO L87 Difference]: Start difference. First operand 752 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,509 INFO L93 Difference]: Finished difference Result 1825 states and 2885 transitions. [2022-07-19 10:56:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-19 10:56:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,513 INFO L225 Difference]: With dead ends: 1825 [2022-07-19 10:56:41,513 INFO L226 Difference]: Without dead ends: 1081 [2022-07-19 10:56:41,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,514 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 135 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 543 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-07-19 10:56:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2022-07-19 10:56:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 1.5787037037037037) internal successors, (1705), 1080 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1705 transitions. [2022-07-19 10:56:41,540 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1705 transitions. Word has length 121 [2022-07-19 10:56:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:41,540 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1705 transitions. [2022-07-19 10:56:41,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1705 transitions. [2022-07-19 10:56:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 10:56:41,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:41,542 INFO L195 NwaCegarLoop]: 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, 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] [2022-07-19 10:56:41,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:56:41,543 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:41,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1941217889, now seen corresponding path program 1 times [2022-07-19 10:56:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:41,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553143288] [2022-07-19 10:56:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 10:56:41,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:41,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553143288] [2022-07-19 10:56:41,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553143288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:41,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:41,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:41,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330040231] [2022-07-19 10:56:41,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:41,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:41,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,576 INFO L87 Difference]: Start difference. First operand 1081 states and 1705 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,695 INFO L93 Difference]: Finished difference Result 2277 states and 3596 transitions. [2022-07-19 10:56:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-19 10:56:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,699 INFO L225 Difference]: With dead ends: 2277 [2022-07-19 10:56:41,699 INFO L226 Difference]: Without dead ends: 1204 [2022-07-19 10:56:41,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,703 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 129 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 145 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-07-19 10:56:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1195. [2022-07-19 10:56:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.5770519262981575) internal successors, (1883), 1194 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1883 transitions. [2022-07-19 10:56:41,735 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1883 transitions. Word has length 121 [2022-07-19 10:56:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:41,735 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1883 transitions. [2022-07-19 10:56:41,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1883 transitions. [2022-07-19 10:56:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 10:56:41,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:41,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:41,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:56:41,738 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 56372730, now seen corresponding path program 1 times [2022-07-19 10:56:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:41,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509622653] [2022-07-19 10:56:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 10:56:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509622653] [2022-07-19 10:56:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509622653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:41,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:41,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056849934] [2022-07-19 10:56:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:41,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:41,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,764 INFO L87 Difference]: Start difference. First operand 1195 states and 1883 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,806 INFO L93 Difference]: Finished difference Result 2788 states and 4398 transitions. [2022-07-19 10:56:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-19 10:56:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,811 INFO L225 Difference]: With dead ends: 2788 [2022-07-19 10:56:41,811 INFO L226 Difference]: Without dead ends: 1601 [2022-07-19 10:56:41,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,813 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 154 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 546 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-19 10:56:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2022-07-19 10:56:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 1.576875) internal successors, (2523), 1600 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2523 transitions. [2022-07-19 10:56:41,851 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2523 transitions. Word has length 122 [2022-07-19 10:56:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:41,851 INFO L495 AbstractCegarLoop]: Abstraction has 1601 states and 2523 transitions. [2022-07-19 10:56:41,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2523 transitions. [2022-07-19 10:56:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 10:56:41,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:41,854 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:41,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:56:41,854 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1445666744, now seen corresponding path program 1 times [2022-07-19 10:56:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:41,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696695596] [2022-07-19 10:56:41,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-19 10:56:41,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:41,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696695596] [2022-07-19 10:56:41,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696695596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:41,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:41,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:41,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530022342] [2022-07-19 10:56:41,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:41,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:41,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:41,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:41,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,882 INFO L87 Difference]: Start difference. First operand 1601 states and 2523 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) [2022-07-19 10:56:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:41,931 INFO L93 Difference]: Finished difference Result 3583 states and 5649 transitions. [2022-07-19 10:56:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-19 10:56:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:41,938 INFO L225 Difference]: With dead ends: 3583 [2022-07-19 10:56:41,939 INFO L226 Difference]: Without dead ends: 1990 [2022-07-19 10:56:41,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:41,941 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:41,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 389 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2022-07-19 10:56:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1990. [2022-07-19 10:56:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 1.5751633986928104) internal successors, (3133), 1989 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3133 transitions. [2022-07-19 10:56:42,009 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3133 transitions. Word has length 122 [2022-07-19 10:56:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:42,009 INFO L495 AbstractCegarLoop]: Abstraction has 1990 states and 3133 transitions. [2022-07-19 10:56:42,009 INFO L496 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) [2022-07-19 10:56:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3133 transitions. [2022-07-19 10:56:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-19 10:56:42,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:42,013 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:42,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:56:42,013 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1809319208, now seen corresponding path program 1 times [2022-07-19 10:56:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:42,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624081200] [2022-07-19 10:56:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-19 10:56:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:42,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624081200] [2022-07-19 10:56:42,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624081200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:42,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:42,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820909975] [2022-07-19 10:56:42,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:42,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:42,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:42,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:42,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:42,064 INFO L87 Difference]: Start difference. First operand 1990 states and 3133 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:42,193 INFO L93 Difference]: Finished difference Result 4022 states and 6314 transitions. [2022-07-19 10:56:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-07-19 10:56:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:42,199 INFO L225 Difference]: With dead ends: 4022 [2022-07-19 10:56:42,199 INFO L226 Difference]: Without dead ends: 2040 [2022-07-19 10:56:42,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:42,203 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:42,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2022-07-19 10:56:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1990. [2022-07-19 10:56:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 1.5409753645047763) internal successors, (3065), 1989 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3065 transitions. [2022-07-19 10:56:42,256 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3065 transitions. Word has length 199 [2022-07-19 10:56:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:42,257 INFO L495 AbstractCegarLoop]: Abstraction has 1990 states and 3065 transitions. [2022-07-19 10:56:42,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3065 transitions. [2022-07-19 10:56:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-19 10:56:42,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:42,261 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:42,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:56:42,261 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1550608766, now seen corresponding path program 1 times [2022-07-19 10:56:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:42,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952985247] [2022-07-19 10:56:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-19 10:56:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952985247] [2022-07-19 10:56:42,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952985247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:42,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:42,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:42,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007643002] [2022-07-19 10:56:42,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:42,311 INFO L87 Difference]: Start difference. First operand 1990 states and 3065 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:42,447 INFO L93 Difference]: Finished difference Result 4039 states and 6195 transitions. [2022-07-19 10:56:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2022-07-19 10:56:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:42,453 INFO L225 Difference]: With dead ends: 4039 [2022-07-19 10:56:42,454 INFO L226 Difference]: Without dead ends: 2057 [2022-07-19 10:56:42,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:42,458 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:42,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2022-07-19 10:56:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1990. [2022-07-19 10:56:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 1.497737556561086) internal successors, (2979), 1989 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2979 transitions. [2022-07-19 10:56:42,511 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2979 transitions. Word has length 213 [2022-07-19 10:56:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:42,511 INFO L495 AbstractCegarLoop]: Abstraction has 1990 states and 2979 transitions. [2022-07-19 10:56:42,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2979 transitions. [2022-07-19 10:56:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-19 10:56:42,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:42,516 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:42,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:56:42,516 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash -832668616, now seen corresponding path program 1 times [2022-07-19 10:56:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:42,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926529538] [2022-07-19 10:56:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-07-19 10:56:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:42,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926529538] [2022-07-19 10:56:42,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926529538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:42,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:42,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:42,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440403972] [2022-07-19 10:56:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:42,555 INFO L87 Difference]: Start difference. First operand 1990 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:42,746 INFO L93 Difference]: Finished difference Result 4217 states and 6306 transitions. [2022-07-19 10:56:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2022-07-19 10:56:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:42,753 INFO L225 Difference]: With dead ends: 4217 [2022-07-19 10:56:42,767 INFO L226 Difference]: Without dead ends: 2110 [2022-07-19 10:56:42,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:42,770 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 47 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:42,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 288 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-07-19 10:56:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2060. [2022-07-19 10:56:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2059 states have (on average 1.473530840213696) internal successors, (3034), 2059 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3034 transitions. [2022-07-19 10:56:42,851 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3034 transitions. Word has length 241 [2022-07-19 10:56:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:42,852 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 3034 transitions. [2022-07-19 10:56:42,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3034 transitions. [2022-07-19 10:56:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-19 10:56:42,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:42,856 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:42,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:56:42,856 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1153610059, now seen corresponding path program 1 times [2022-07-19 10:56:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:42,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784595024] [2022-07-19 10:56:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 10:56:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784595024] [2022-07-19 10:56:42,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784595024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315737970] [2022-07-19 10:56:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:42,898 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) [2022-07-19 10:56:42,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:56:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:43,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:43,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 10:56:43,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:56:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 10:56:43,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315737970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:56:43,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:56:43,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 10:56:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102324183] [2022-07-19 10:56:43,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:56:43,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:56:43,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:43,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:56:43,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:56:43,226 INFO L87 Difference]: Start difference. First operand 2060 states and 3034 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:44,016 INFO L93 Difference]: Finished difference Result 8989 states and 13226 transitions. [2022-07-19 10:56:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:56:44,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-19 10:56:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:44,042 INFO L225 Difference]: With dead ends: 8989 [2022-07-19 10:56:44,042 INFO L226 Difference]: Without dead ends: 6937 [2022-07-19 10:56:44,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:56:44,047 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 462 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:44,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1570 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:56:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6937 states. [2022-07-19 10:56:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6937 to 2845. [2022-07-19 10:56:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2844 states have (on average 1.3463431786216595) internal successors, (3829), 2844 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3829 transitions. [2022-07-19 10:56:44,160 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3829 transitions. Word has length 253 [2022-07-19 10:56:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:44,160 INFO L495 AbstractCegarLoop]: Abstraction has 2845 states and 3829 transitions. [2022-07-19 10:56:44,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3829 transitions. [2022-07-19 10:56:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-19 10:56:44,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:44,165 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:44,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:44,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-19 10:56:44,385 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash -864790669, now seen corresponding path program 1 times [2022-07-19 10:56:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:44,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292302812] [2022-07-19 10:56:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-19 10:56:44,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:44,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292302812] [2022-07-19 10:56:44,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292302812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:44,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:44,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71181904] [2022-07-19 10:56:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:44,422 INFO L87 Difference]: Start difference. First operand 2845 states and 3829 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:44,528 INFO L93 Difference]: Finished difference Result 8058 states and 10910 transitions. [2022-07-19 10:56:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-19 10:56:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:44,538 INFO L225 Difference]: With dead ends: 8058 [2022-07-19 10:56:44,538 INFO L226 Difference]: Without dead ends: 5221 [2022-07-19 10:56:44,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:44,542 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:44,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 543 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2022-07-19 10:56:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 5219. [2022-07-19 10:56:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5218 states have (on average 1.3566500574932925) internal successors, (7079), 5218 states have internal predecessors, (7079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 7079 transitions. [2022-07-19 10:56:44,692 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 7079 transitions. Word has length 253 [2022-07-19 10:56:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:44,692 INFO L495 AbstractCegarLoop]: Abstraction has 5219 states and 7079 transitions. [2022-07-19 10:56:44,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 7079 transitions. [2022-07-19 10:56:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-19 10:56:44,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:44,700 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:44,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:56:44,701 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 52349753, now seen corresponding path program 1 times [2022-07-19 10:56:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:44,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816909118] [2022-07-19 10:56:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 10:56:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:44,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816909118] [2022-07-19 10:56:44,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816909118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:44,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:44,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561419269] [2022-07-19 10:56:44,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:44,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:44,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:44,735 INFO L87 Difference]: Start difference. First operand 5219 states and 7079 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:44,959 INFO L93 Difference]: Finished difference Result 10530 states and 14266 transitions. [2022-07-19 10:56:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2022-07-19 10:56:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:44,968 INFO L225 Difference]: With dead ends: 10530 [2022-07-19 10:56:44,968 INFO L226 Difference]: Without dead ends: 5319 [2022-07-19 10:56:44,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:44,973 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 150 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:44,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 184 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2022-07-19 10:56:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5219. [2022-07-19 10:56:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5218 states have (on average 1.3363357608279034) internal successors, (6973), 5218 states have internal predecessors, (6973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 6973 transitions. [2022-07-19 10:56:45,131 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 6973 transitions. Word has length 256 [2022-07-19 10:56:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:45,131 INFO L495 AbstractCegarLoop]: Abstraction has 5219 states and 6973 transitions. [2022-07-19 10:56:45,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 6973 transitions. [2022-07-19 10:56:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-07-19 10:56:45,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:45,140 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:45,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:56:45,140 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash 212492165, now seen corresponding path program 1 times [2022-07-19 10:56:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041107948] [2022-07-19 10:56:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 10:56:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:45,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041107948] [2022-07-19 10:56:45,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041107948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:45,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628777672] [2022-07-19 10:56:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:45,196 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) [2022-07-19 10:56:45,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:56:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:45,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 10:56:45,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-19 10:56:45,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:56:45,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628777672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:45,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:56:45,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-19 10:56:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232580098] [2022-07-19 10:56:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:45,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:45,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:45,339 INFO L87 Difference]: Start difference. First operand 5219 states and 6973 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:45,561 INFO L93 Difference]: Finished difference Result 9731 states and 13058 transitions. [2022-07-19 10:56:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:45,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 282 [2022-07-19 10:56:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:45,570 INFO L225 Difference]: With dead ends: 9731 [2022-07-19 10:56:45,571 INFO L226 Difference]: Without dead ends: 5559 [2022-07-19 10:56:45,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:45,577 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 111 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:45,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 250 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5559 states. [2022-07-19 10:56:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5559 to 5239. [2022-07-19 10:56:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5239 states, 5238 states have (on average 1.3323787705231005) internal successors, (6979), 5238 states have internal predecessors, (6979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 6979 transitions. [2022-07-19 10:56:45,752 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 6979 transitions. Word has length 282 [2022-07-19 10:56:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:45,752 INFO L495 AbstractCegarLoop]: Abstraction has 5239 states and 6979 transitions. [2022-07-19 10:56:45,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 6979 transitions. [2022-07-19 10:56:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-19 10:56:45,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:45,761 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:45,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:45,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-19 10:56:45,976 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1760130215, now seen corresponding path program 1 times [2022-07-19 10:56:45,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:45,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202791457] [2022-07-19 10:56:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 10:56:46,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:46,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202791457] [2022-07-19 10:56:46,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202791457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:46,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360601834] [2022-07-19 10:56:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:46,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:46,028 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) [2022-07-19 10:56:46,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:56:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:46,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:46,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-19 10:56:46,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:56:46,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360601834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:46,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:56:46,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-19 10:56:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181114698] [2022-07-19 10:56:46,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:46,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:46,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:46,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:46,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:46,137 INFO L87 Difference]: Start difference. First operand 5239 states and 6979 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:46,300 INFO L93 Difference]: Finished difference Result 10470 states and 13946 transitions. [2022-07-19 10:56:46,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:46,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2022-07-19 10:56:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:46,308 INFO L225 Difference]: With dead ends: 10470 [2022-07-19 10:56:46,308 INFO L226 Difference]: Without dead ends: 5239 [2022-07-19 10:56:46,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:46,316 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:46,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 305 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2022-07-19 10:56:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 5239. [2022-07-19 10:56:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5239 states, 5238 states have (on average 1.3304696449026345) internal successors, (6969), 5238 states have internal predecessors, (6969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 6969 transitions. [2022-07-19 10:56:46,461 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 6969 transitions. Word has length 283 [2022-07-19 10:56:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:46,462 INFO L495 AbstractCegarLoop]: Abstraction has 5239 states and 6969 transitions. [2022-07-19 10:56:46,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 6969 transitions. [2022-07-19 10:56:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-19 10:56:46,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:46,470 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:46,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:46,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:46,689 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash 228335597, now seen corresponding path program 1 times [2022-07-19 10:56:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:46,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911629715] [2022-07-19 10:56:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 10:56:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:46,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911629715] [2022-07-19 10:56:46,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911629715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:46,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239017332] [2022-07-19 10:56:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:46,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:46,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:46,744 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) [2022-07-19 10:56:46,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:56:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:46,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:46,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 10:56:46,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:56:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 10:56:46,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239017332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:56:46,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:56:46,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 10:56:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052451897] [2022-07-19 10:56:46,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:56:46,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:56:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:56:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:56:46,928 INFO L87 Difference]: Start difference. First operand 5239 states and 6969 transitions. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:47,267 INFO L93 Difference]: Finished difference Result 11481 states and 15154 transitions. [2022-07-19 10:56:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:56:47,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 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 283 [2022-07-19 10:56:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:47,277 INFO L225 Difference]: With dead ends: 11481 [2022-07-19 10:56:47,277 INFO L226 Difference]: Without dead ends: 6168 [2022-07-19 10:56:47,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:56:47,283 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 513 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:47,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 490 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:56:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2022-07-19 10:56:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 4204. [2022-07-19 10:56:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4204 states, 4203 states have (on average 1.3043064477753985) internal successors, (5482), 4203 states have internal predecessors, (5482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 4204 states and 5482 transitions. [2022-07-19 10:56:47,398 INFO L78 Accepts]: Start accepts. Automaton has 4204 states and 5482 transitions. Word has length 283 [2022-07-19 10:56:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:47,399 INFO L495 AbstractCegarLoop]: Abstraction has 4204 states and 5482 transitions. [2022-07-19 10:56:47,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 5482 transitions. [2022-07-19 10:56:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-07-19 10:56:47,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:47,406 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:47,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:47,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-19 10:56:47,625 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1511923228, now seen corresponding path program 1 times [2022-07-19 10:56:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:47,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738851474] [2022-07-19 10:56:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-19 10:56:47,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:47,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738851474] [2022-07-19 10:56:47,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738851474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:47,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:47,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970350926] [2022-07-19 10:56:47,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:47,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:47,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:47,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:47,660 INFO L87 Difference]: Start difference. First operand 4204 states and 5482 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:47,798 INFO L93 Difference]: Finished difference Result 7084 states and 9168 transitions. [2022-07-19 10:56:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2022-07-19 10:56:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:47,802 INFO L225 Difference]: With dead ends: 7084 [2022-07-19 10:56:47,802 INFO L226 Difference]: Without dead ends: 2245 [2022-07-19 10:56:47,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:47,806 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:47,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 287 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2022-07-19 10:56:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2022-07-19 10:56:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 2244 states have (on average 1.2932263814616756) internal successors, (2902), 2244 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 2902 transitions. [2022-07-19 10:56:47,870 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 2902 transitions. Word has length 321 [2022-07-19 10:56:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:47,870 INFO L495 AbstractCegarLoop]: Abstraction has 2245 states and 2902 transitions. [2022-07-19 10:56:47,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2902 transitions. [2022-07-19 10:56:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-07-19 10:56:47,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:47,876 INFO L195 NwaCegarLoop]: 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, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:47,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 10:56:47,876 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash 765784792, now seen corresponding path program 1 times [2022-07-19 10:56:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:47,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458651491] [2022-07-19 10:56:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-07-19 10:56:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:47,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458651491] [2022-07-19 10:56:47,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458651491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:47,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:47,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780168084] [2022-07-19 10:56:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:47,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:47,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:47,911 INFO L87 Difference]: Start difference. First operand 2245 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:48,028 INFO L93 Difference]: Finished difference Result 4571 states and 5904 transitions. [2022-07-19 10:56:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 323 [2022-07-19 10:56:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:48,032 INFO L225 Difference]: With dead ends: 4571 [2022-07-19 10:56:48,032 INFO L226 Difference]: Without dead ends: 2334 [2022-07-19 10:56:48,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:48,035 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:48,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 294 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2022-07-19 10:56:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2314. [2022-07-19 10:56:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2313 states have (on average 1.2909641158668397) internal successors, (2986), 2313 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 2986 transitions. [2022-07-19 10:56:48,099 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 2986 transitions. Word has length 323 [2022-07-19 10:56:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:48,099 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 2986 transitions. [2022-07-19 10:56:48,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2986 transitions. [2022-07-19 10:56:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-07-19 10:56:48,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:48,105 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:48,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 10:56:48,106 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2092257525, now seen corresponding path program 1 times [2022-07-19 10:56:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:48,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037129953] [2022-07-19 10:56:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-07-19 10:56:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037129953] [2022-07-19 10:56:48,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037129953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:48,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:48,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890194806] [2022-07-19 10:56:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:48,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:48,148 INFO L87 Difference]: Start difference. First operand 2314 states and 2986 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:48,266 INFO L93 Difference]: Finished difference Result 4810 states and 6230 transitions. [2022-07-19 10:56:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:48,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 344 [2022-07-19 10:56:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:48,271 INFO L225 Difference]: With dead ends: 4810 [2022-07-19 10:56:48,272 INFO L226 Difference]: Without dead ends: 2504 [2022-07-19 10:56:48,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:48,275 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 29 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:48,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 294 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2022-07-19 10:56:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2439. [2022-07-19 10:56:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2438 states have (on average 1.2863002461033635) internal successors, (3136), 2438 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3136 transitions. [2022-07-19 10:56:48,343 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3136 transitions. Word has length 344 [2022-07-19 10:56:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:48,344 INFO L495 AbstractCegarLoop]: Abstraction has 2439 states and 3136 transitions. [2022-07-19 10:56:48,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3136 transitions. [2022-07-19 10:56:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2022-07-19 10:56:48,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:48,350 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:48,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 10:56:48,351 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash 245519722, now seen corresponding path program 1 times [2022-07-19 10:56:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:48,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007448782] [2022-07-19 10:56:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2022-07-19 10:56:48,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:48,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007448782] [2022-07-19 10:56:48,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007448782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:48,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:48,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792480663] [2022-07-19 10:56:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:48,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:48,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:48,401 INFO L87 Difference]: Start difference. First operand 2439 states and 3136 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) [2022-07-19 10:56:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:48,510 INFO L93 Difference]: Finished difference Result 4910 states and 6325 transitions. [2022-07-19 10:56:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:48,511 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 370 [2022-07-19 10:56:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:48,514 INFO L225 Difference]: With dead ends: 4910 [2022-07-19 10:56:48,514 INFO L226 Difference]: Without dead ends: 2479 [2022-07-19 10:56:48,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:48,518 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:48,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2022-07-19 10:56:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2439. [2022-07-19 10:56:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2438 states have (on average 1.2760459392945036) internal successors, (3111), 2438 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3111 transitions. [2022-07-19 10:56:48,594 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3111 transitions. Word has length 370 [2022-07-19 10:56:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:48,595 INFO L495 AbstractCegarLoop]: Abstraction has 2439 states and 3111 transitions. [2022-07-19 10:56:48,595 INFO L496 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) [2022-07-19 10:56:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3111 transitions. [2022-07-19 10:56:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-07-19 10:56:48,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:48,599 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:48,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 10:56:48,599 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 35349519, now seen corresponding path program 1 times [2022-07-19 10:56:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:48,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926070175] [2022-07-19 10:56:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-07-19 10:56:48,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:48,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926070175] [2022-07-19 10:56:48,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926070175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:48,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407070338] [2022-07-19 10:56:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:48,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:48,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:48,668 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) [2022-07-19 10:56:48,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:56:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:48,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:48,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-07-19 10:56:48,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:56:48,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407070338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:48,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:56:48,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-19 10:56:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186727304] [2022-07-19 10:56:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:48,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:48,984 INFO L87 Difference]: Start difference. First operand 2439 states and 3111 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:49,034 INFO L93 Difference]: Finished difference Result 3046 states and 3899 transitions. [2022-07-19 10:56:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:49,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2022-07-19 10:56:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:49,041 INFO L225 Difference]: With dead ends: 3046 [2022-07-19 10:56:49,042 INFO L226 Difference]: Without dead ends: 2954 [2022-07-19 10:56:49,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:49,043 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 90 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:49,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 449 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2022-07-19 10:56:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2349. [2022-07-19 10:56:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2348 states have (on average 1.2819420783645656) internal successors, (3010), 2348 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3010 transitions. [2022-07-19 10:56:49,095 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3010 transitions. Word has length 393 [2022-07-19 10:56:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:49,095 INFO L495 AbstractCegarLoop]: Abstraction has 2349 states and 3010 transitions. [2022-07-19 10:56:49,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3010 transitions. [2022-07-19 10:56:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2022-07-19 10:56:49,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:49,101 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:49,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:49,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-19 10:56:49,319 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 431667755, now seen corresponding path program 1 times [2022-07-19 10:56:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:49,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898667306] [2022-07-19 10:56:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2022-07-19 10:56:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898667306] [2022-07-19 10:56:49,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898667306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967232371] [2022-07-19 10:56:49,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:49,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:49,393 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) [2022-07-19 10:56:49,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:56:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:49,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:49,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2022-07-19 10:56:49,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:56:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2022-07-19 10:56:49,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967232371] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:56:49,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:56:49,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 10:56:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457232227] [2022-07-19 10:56:49,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:56:49,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:56:49,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:56:49,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:56:49,638 INFO L87 Difference]: Start difference. First operand 2349 states and 3010 transitions. Second operand has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:49,905 INFO L93 Difference]: Finished difference Result 5862 states and 7496 transitions. [2022-07-19 10:56:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:56:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 533 [2022-07-19 10:56:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:49,911 INFO L225 Difference]: With dead ends: 5862 [2022-07-19 10:56:49,911 INFO L226 Difference]: Without dead ends: 3451 [2022-07-19 10:56:49,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 1066 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:56:49,914 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 303 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:49,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 525 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:56:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2022-07-19 10:56:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 2374. [2022-07-19 10:56:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 1.2747576906868943) internal successors, (3025), 2373 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3025 transitions. [2022-07-19 10:56:49,993 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3025 transitions. Word has length 533 [2022-07-19 10:56:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:49,994 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 3025 transitions. [2022-07-19 10:56:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3025 transitions. [2022-07-19 10:56:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-07-19 10:56:49,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:49,999 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 10, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:50,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:50,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:50,217 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -32232603, now seen corresponding path program 1 times [2022-07-19 10:56:50,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:50,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118783238] [2022-07-19 10:56:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4036 backedges. 1616 proven. 0 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2022-07-19 10:56:50,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118783238] [2022-07-19 10:56:50,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118783238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:50,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:50,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:50,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008902349] [2022-07-19 10:56:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:50,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:50,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:50,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:50,274 INFO L87 Difference]: Start difference. First operand 2374 states and 3025 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:50,378 INFO L93 Difference]: Finished difference Result 4750 states and 6048 transitions. [2022-07-19 10:56:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 595 [2022-07-19 10:56:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:50,382 INFO L225 Difference]: With dead ends: 4750 [2022-07-19 10:56:50,382 INFO L226 Difference]: Without dead ends: 2384 [2022-07-19 10:56:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:50,384 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:50,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-07-19 10:56:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2374. [2022-07-19 10:56:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 1.2642225031605563) internal successors, (3000), 2373 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3000 transitions. [2022-07-19 10:56:50,439 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3000 transitions. Word has length 595 [2022-07-19 10:56:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:50,439 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 3000 transitions. [2022-07-19 10:56:50,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3000 transitions. [2022-07-19 10:56:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2022-07-19 10:56:50,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:50,445 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:50,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-19 10:56:50,445 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1381913185, now seen corresponding path program 1 times [2022-07-19 10:56:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:50,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104759631] [2022-07-19 10:56:50,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 2404 proven. 0 refuted. 0 times theorem prover too weak. 2567 trivial. 0 not checked. [2022-07-19 10:56:50,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104759631] [2022-07-19 10:56:50,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104759631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:50,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:50,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89587897] [2022-07-19 10:56:50,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:50,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:50,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:50,515 INFO L87 Difference]: Start difference. First operand 2374 states and 3000 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:50,638 INFO L93 Difference]: Finished difference Result 4920 states and 6228 transitions. [2022-07-19 10:56:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 661 [2022-07-19 10:56:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:50,642 INFO L225 Difference]: With dead ends: 4920 [2022-07-19 10:56:50,643 INFO L226 Difference]: Without dead ends: 2554 [2022-07-19 10:56:50,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:50,646 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:50,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-07-19 10:56:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2544. [2022-07-19 10:56:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2543 states have (on average 1.256390090444357) internal successors, (3195), 2543 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3195 transitions. [2022-07-19 10:56:50,701 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3195 transitions. Word has length 661 [2022-07-19 10:56:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:50,701 INFO L495 AbstractCegarLoop]: Abstraction has 2544 states and 3195 transitions. [2022-07-19 10:56:50,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3195 transitions. [2022-07-19 10:56:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2022-07-19 10:56:50,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:50,707 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-19 10:56:50,707 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash -372840571, now seen corresponding path program 1 times [2022-07-19 10:56:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:50,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737125227] [2022-07-19 10:56:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2022-07-19 10:56:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:50,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737125227] [2022-07-19 10:56:50,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737125227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:50,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176687513] [2022-07-19 10:56:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:50,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:50,804 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:56:50,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:56:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:50,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:50,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2022-07-19 10:56:51,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:56:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2022-07-19 10:56:51,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176687513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:56:51,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:56:51,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-19 10:56:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238645274] [2022-07-19 10:56:51,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:56:51,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:56:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:56:51,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:56:51,099 INFO L87 Difference]: Start difference. First operand 2544 states and 3195 transitions. Second operand has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:51,298 INFO L93 Difference]: Finished difference Result 3638 states and 4573 transitions. [2022-07-19 10:56:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:56:51,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 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 723 [2022-07-19 10:56:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:51,299 INFO L225 Difference]: With dead ends: 3638 [2022-07-19 10:56:51,299 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:56:51,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1452 GetRequests, 1444 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:56:51,303 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 74 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:51,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 872 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:56:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:56:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:56:51,304 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) [2022-07-19 10:56:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:56:51,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 723 [2022-07-19 10:56:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:51,305 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:56:51,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:56:51,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:56:51,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:56:51,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:51,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:51,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:57:01,308 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-07-19 10:57:01,308 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2022-07-19 10:57:01,309 INFO L895 garLoopResultBuilder]: At program point L366(lines 342 384) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse5 .cse6))) [2022-07-19 10:57:01,309 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse1) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse0 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse9 .cse0 .cse10 .cse11 .cse12 .cse4 .cse13 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse10 .cse11 .cse12 .cse4 .cse1 .cse13 .cse5))) [2022-07-19 10:57:01,309 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6 .cse7))) [2022-07-19 10:57:01,309 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8480 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2022-07-19 10:57:01,309 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-07-19 10:57:01,309 INFO L899 garLoopResultBuilder]: For program point L433(lines 433 435) no Hoare annotation was computed. [2022-07-19 10:57:01,310 INFO L895 garLoopResultBuilder]: At program point L400(lines 391 423) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6 .cse7))) [2022-07-19 10:57:01,310 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 303) no Hoare annotation was computed. [2022-07-19 10:57:01,310 INFO L899 garLoopResultBuilder]: For program point L301-2(lines 219 553) no Hoare annotation was computed. [2022-07-19 10:57:01,310 INFO L902 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2022-07-19 10:57:01,310 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-07-19 10:57:01,310 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2022-07-19 10:57:01,310 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2022-07-19 10:57:01,310 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 340) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L336-2(lines 219 553) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 421) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L503(lines 503 506) no Hoare annotation was computed. [2022-07-19 10:57:01,311 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 410) no Hoare annotation was computed. [2022-07-19 10:57:01,312 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-07-19 10:57:01,312 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2022-07-19 10:57:01,312 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2022-07-19 10:57:01,312 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2022-07-19 10:57:01,312 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse2 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (not .cse3) .cse4))) [2022-07-19 10:57:01,312 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse1 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse4))) [2022-07-19 10:57:01,312 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 474) no Hoare annotation was computed. [2022-07-19 10:57:01,312 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 312) no Hoare annotation was computed. [2022-07-19 10:57:01,312 INFO L899 garLoopResultBuilder]: For program point L308-2(lines 308 312) no Hoare annotation was computed. [2022-07-19 10:57:01,313 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2022-07-19 10:57:01,313 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2022-07-19 10:57:01,313 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2022-07-19 10:57:01,313 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse9 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse21 (<= 8480 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse11 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse15 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse23 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse20 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (not .cse9)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse27 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse25 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse22 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse26 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse6 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse4 .cse5 .cse6 .cse3) (and .cse4 .cse0 .cse1 .cse3) (and .cse7 .cse8 .cse0 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse14 .cse9 .cse6 .cse15) (and .cse11 .cse12 .cse14 .cse6 .cse2 .cse15) (and .cse4 .cse16) (and .cse17 .cse18 .cse12 .cse13 .cse7 .cse19 .cse20 .cse14 .cse9 .cse21 .cse10) (and .cse17 .cse18 .cse12 .cse8 .cse20 .cse14 .cse21 .cse22) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse23 .cse10) (and .cse8 .cse5 .cse24 .cse6 .cse25) (and .cse11 .cse12 .cse8 .cse14 .cse6 .cse15) (and .cse13 .cse7 .cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) .cse0 .cse10) (and .cse13 .cse16) (and .cse23 .cse5 .cse26 .cse9 .cse6) (and .cse8 .cse16) (and .cse13 .cse5 .cse24 .cse9 .cse6 .cse25) (and .cse17 .cse18 .cse8 .cse20 .cse1 .cse27) (and .cse7 .cse4 .cse0 .cse2 .cse3 .cse10) (and .cse8 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) .cse24 .cse25 .cse22) (and .cse13 .cse27 .cse24 .cse9 .cse25 .cse22) (and .cse16 .cse2) (and .cse8 .cse5 .cse26 .cse9 .cse6)))) [2022-07-19 10:57:01,313 INFO L899 garLoopResultBuilder]: For program point L441-1(lines 441 449) no Hoare annotation was computed. [2022-07-19 10:57:01,313 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-07-19 10:57:01,313 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse6 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 (not .cse2)) (and .cse3 .cse0 .cse4 .cse1 .cse5) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse6 .cse2 .cse1) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse4 .cse2 .cse1 .cse5) (and .cse3 .cse0 .cse6 .cse2 .cse1))) [2022-07-19 10:57:01,314 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse3 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse4) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4))) [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 553) no Hoare annotation was computed. [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2022-07-19 10:57:01,314 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2022-07-19 10:57:01,315 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2022-07-19 10:57:01,315 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 447) no Hoare annotation was computed. [2022-07-19 10:57:01,315 INFO L899 garLoopResultBuilder]: For program point L345(lines 345 383) no Hoare annotation was computed. [2022-07-19 10:57:01,315 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 16384)) (.cse2 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1 .cse2 .cse3) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (not .cse3)))) [2022-07-19 10:57:01,315 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: false [2022-07-19 10:57:01,315 INFO L902 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-07-19 10:57:01,315 INFO L899 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2022-07-19 10:57:01,315 INFO L895 garLoopResultBuilder]: At program point L412(lines 403 421) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6 .cse7))) [2022-07-19 10:57:01,315 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2022-07-19 10:57:01,316 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2022-07-19 10:57:01,316 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2022-07-19 10:57:01,316 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2022-07-19 10:57:01,316 INFO L899 garLoopResultBuilder]: For program point L348(lines 348 382) no Hoare annotation was computed. [2022-07-19 10:57:01,316 INFO L899 garLoopResultBuilder]: For program point L348-1(lines 348 382) no Hoare annotation was computed. [2022-07-19 10:57:01,316 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-19 10:57:01,316 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse7))) [2022-07-19 10:57:01,316 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse5 (<= 8480 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L481(lines 481 483) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 417) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 379) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2022-07-19 10:57:01,317 INFO L899 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 326) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L319-2(lines 319 326) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2022-07-19 10:57:01,318 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2022-07-19 10:57:01,319 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 377) no Hoare annotation was computed. [2022-07-19 10:57:01,319 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-07-19 10:57:01,319 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: false [2022-07-19 10:57:01,319 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse7))) [2022-07-19 10:57:01,319 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse5 .cse6))) [2022-07-19 10:57:01,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:57:01,319 INFO L902 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2022-07-19 10:57:01,319 INFO L895 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse9 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse21 (<= 8480 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse11 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse15 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse23 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse20 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (not .cse9)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse27 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse25 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse22 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse26 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse6 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse4 .cse5 .cse6 .cse3) (and .cse4 .cse0 .cse1 .cse3) (and .cse7 .cse8 .cse0 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse14 .cse9 .cse6 .cse15) (and .cse4 .cse16) (and .cse17 .cse18 .cse12 .cse13 .cse7 .cse19 .cse20 .cse14 .cse9 .cse21 .cse10) (and .cse17 .cse18 .cse12 .cse8 .cse20 .cse14 .cse21 .cse22) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse23 .cse10) (and .cse8 .cse5 .cse24 .cse6 .cse25) (and .cse11 .cse12 .cse8 .cse14 .cse6 .cse15) (and .cse13 .cse7 .cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) .cse0 .cse10) (and .cse13 .cse16) (and .cse23 .cse5 .cse26 .cse9 .cse6) (and .cse8 .cse16) (and .cse13 .cse5 .cse24 .cse9 .cse6 .cse25) (and .cse17 .cse18 .cse8 .cse20 .cse1 .cse27) (and .cse7 .cse4 .cse0 .cse2 .cse3 .cse10) (and .cse8 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) .cse24 .cse25 .cse22) (and .cse13 .cse27 .cse24 .cse9 .cse25 .cse22) (and .cse16 .cse2) (and .cse8 .cse5 .cse26 .cse9 .cse6)))) [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 457) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 325) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L357-2(lines 357 361) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-19 10:57:01,320 INFO L899 garLoopResultBuilder]: For program point L490(lines 490 492) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 423) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 467) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 398) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2022-07-19 10:57:01,321 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-07-19 10:57:01,322 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2022-07-19 10:57:01,322 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2022-07-19 10:57:01,322 INFO L895 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-07-19 10:57:01,322 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse7))) [2022-07-19 10:57:01,322 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse5 .cse6))) [2022-07-19 10:57:01,322 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-07-19 10:57:01,322 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-07-19 10:57:01,322 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2022-07-19 10:57:01,323 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point L462(lines 462 464) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: false [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 304) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 373) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2022-07-19 10:57:01,324 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2022-07-19 10:57:01,325 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2022-07-19 10:57:01,325 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-07-19 10:57:01,325 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2022-07-19 10:57:01,327 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-19 10:57:01,329 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:57:01,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:57:01 BoogieIcfgContainer [2022-07-19 10:57:01,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:57:01,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:57:01,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:57:01,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:57:01,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:56:38" (3/4) ... [2022-07-19 10:57:01,356 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:57:01,366 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-19 10:57:01,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 10:57:01,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:57:01,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:57:01,428 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:57:01,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:57:01,431 INFO L158 Benchmark]: Toolchain (without parser) took 23694.25ms. Allocated memory was 100.7MB in the beginning and 851.4MB in the end (delta: 750.8MB). Free memory was 67.4MB in the beginning and 477.5MB in the end (delta: -410.1MB). Peak memory consumption was 341.6MB. Max. memory is 16.1GB. [2022-07-19 10:57:01,434 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:57:01,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.75ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 67.4MB in the beginning and 91.5MB in the end (delta: -24.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 10:57:01,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.39ms. Allocated memory is still 121.6MB. Free memory was 91.5MB in the beginning and 88.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:57:01,436 INFO L158 Benchmark]: Boogie Preprocessor took 54.49ms. Allocated memory is still 121.6MB. Free memory was 88.3MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:57:01,436 INFO L158 Benchmark]: RCFGBuilder took 681.95ms. Allocated memory is still 121.6MB. Free memory was 86.2MB in the beginning and 95.5MB in the end (delta: -9.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-07-19 10:57:01,437 INFO L158 Benchmark]: TraceAbstraction took 22513.50ms. Allocated memory was 121.6MB in the beginning and 851.4MB in the end (delta: 729.8MB). Free memory was 94.9MB in the beginning and 485.0MB in the end (delta: -390.1MB). Peak memory consumption was 534.4MB. Max. memory is 16.1GB. [2022-07-19 10:57:01,437 INFO L158 Benchmark]: Witness Printer took 75.27ms. Allocated memory is still 851.4MB. Free memory was 485.0MB in the beginning and 477.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:57:01,438 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.19ms. Allocated memory is still 100.7MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.75ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 67.4MB in the beginning and 91.5MB in the end (delta: -24.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.39ms. Allocated memory is still 121.6MB. Free memory was 91.5MB in the beginning and 88.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.49ms. Allocated memory is still 121.6MB. Free memory was 88.3MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 681.95ms. Allocated memory is still 121.6MB. Free memory was 86.2MB in the beginning and 95.5MB in the end (delta: -9.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22513.50ms. Allocated memory was 121.6MB in the beginning and 851.4MB in the end (delta: 729.8MB). Free memory was 94.9MB in the beginning and 485.0MB in the end (delta: -390.1MB). Peak memory consumption was 534.4MB. Max. memory is 16.1GB. * Witness Printer took 75.27ms. Allocated memory is still 851.4MB. Free memory was 485.0MB in the beginning and 477.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 619]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 37, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4941 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4941 mSDsluCounter, 11931 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4565 mSDsCounter, 1100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4975 IncrementalHoareTripleChecker+Invalid, 6075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1100 mSolverCounterUnsat, 7366 mSDtfsCounter, 4975 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4669 GetRequests, 4602 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5239occurred in iteration=26, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 8533 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 192 NumberOfFragments, 2170 HoareAnnotationTreeSize, 28 FomulaSimplifications, 48158 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 152755 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 11088 NumberOfCodeBlocks, 11088 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 12832 ConstructedInterpolants, 0 QuantifiedInterpolants, 17071 SizeOfPredicates, 4 NumberOfNonLiveVariables, 4555 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 48 InterpolantComputations, 33 PerfectInterpolantSequences, 54520/54748 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: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(s__state == 8640)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8480 <= s__state) && !(8560 == s__state)) || (((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8480 <= s__state) && !(8560 == s__state))) || (((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8480 <= s__state) && !(8560 == s__state))) || (((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8480 <= s__state) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((blastFlag == 1 && !(s__state == 8672)) && !(s__state == 8640)) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672) || ((((2 == blastFlag && !(s__state == 8672)) && !(s__state == 8640)) && 8640 <= s__state) && s__state <= 8672)) || ((((((!(s__state == 8672) && !(s__state == 8640)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && !(8496 <= s__state)) || (((((!(8448 == s__state) && !(s__state == 8481)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8496 <= s__state))) || (((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8480)) && 8448 <= s__state) && !(8496 <= s__state)) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((8640 <= s__state && s__state <= 8640) && blastFlag == 0) && !(0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && !(8496 <= s__state))) || (((((!(8448 == s__state) && !(s__state == 8481)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8496 <= s__state))) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8480 <= s__state) && s__state <= 8672)) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8480 <= s__state) && s__state <= 8576)) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8480)) && 8448 <= s__state) && !(8496 <= s__state))) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8640)) && 8640 <= s__state) && s__state <= 8672)) || (2 == blastFlag && s__state == 3)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (blastFlag == 1 && s__state == 3)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && 8496 < s__state)) || (((((!(s__state == 8657) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672)) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (s__state == 3 && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) && s__state <= 8576) || ((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((8672 <= s__state && blastFlag == 1) && s__state < 16384) && !(12292 == s__state)) && 0 == s__hit) || (((8672 <= s__state && 3 == blastFlag) && s__state < 16384) && !(12292 == s__state))) || (((((8672 <= s__state && s__s3__tmp__next_state___0 <= 8640) && s__state < 16384) && !(12292 == s__state)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) && s__state <= 8576) || ((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((!(s__state == 8545) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && s__state <= 8576) || ((((((!(s__state == 8545) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && s__state <= 8576) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(s__state == 8640)) && s__state <= 8640) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8544 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8480 <= s__state) && !(8560 == s__state)) && s__state <= 8576) || ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8544 == s__state)) && !(s__state == 8480)) && 8480 <= s__state) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((8640 <= s__state && s__state <= 8640) && blastFlag == 0) && !(0 == s__hit)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8656)) && s__state <= 8672)) || (((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && 8640 <= s__state) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) && s__state <= 8576) || ((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((8640 <= s__state && s__state <= 8640) && blastFlag == 0) && !(0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && !(8496 <= s__state))) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8480 <= s__state) && s__state <= 8672)) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8480 <= s__state) && s__state <= 8576)) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8480)) && 8448 <= s__state) && !(8496 <= s__state))) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8640)) && 8640 <= s__state) && s__state <= 8672)) || (2 == blastFlag && s__state == 3)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (blastFlag == 1 && s__state == 3)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && 8496 < s__state)) || (((((!(s__state == 8657) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672)) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (s__state == 3 && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) RESULT: Ultimate proved your program to be correct! [2022-07-19 10:57:01,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE