/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:22,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:22,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:22,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:22,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:22,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:22,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:22,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:22,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:22,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:22,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:22,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:22,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:22,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:22,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:22,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:22,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:22,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:22,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:22,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:22,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:22,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:22,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:22,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:22,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:22,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:22,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:22,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:22,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:22,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:22,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:22,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:22,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:22,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:22,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:22,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:22,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:22,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:22,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:22,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:22,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:22,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:30:22,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:22,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:22,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:22,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:22,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:22,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:22,325 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:22,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:22,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:22,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:22,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:22,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:22,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:22,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:22,326 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:22,327 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:22,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:22,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:22,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:22,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:22,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:22,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:22,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:22,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:22,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:22,329 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:22,329 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:30:22,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:22,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:22,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:22,544 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:22,546 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:22,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c [2022-01-11 03:30:22,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c84dced/123853a21a644a6f9a8f06a6dc2bce70/FLAG43e22a8a3 [2022-01-11 03:30:22,964 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:22,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c [2022-01-11 03:30:22,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c84dced/123853a21a644a6f9a8f06a6dc2bce70/FLAG43e22a8a3 [2022-01-11 03:30:22,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c84dced/123853a21a644a6f9a8f06a6dc2bce70 [2022-01-11 03:30:22,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:22,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:22,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:22,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:22,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:22,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:22" (1/1) ... [2022-01-11 03:30:23,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf9bebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23, skipping insertion in model container [2022-01-11 03:30:23,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:22" (1/1) ... [2022-01-11 03:30:23,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:23,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:23,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-01-11 03:30:23,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:23,212 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:23,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-01-11 03:30:23,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:23,263 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:23,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23 WrapperNode [2022-01-11 03:30:23,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:23,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:23,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:23,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:23,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,314 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 500 [2022-01-11 03:30:23,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:23,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:23,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:23,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:23,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:23,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:23,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:23,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:23,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:23,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:23,370 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-01-11 03:30:23,389 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-01-11 03:30:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:23,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:23,493 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:23,494 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:23,517 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:30:23,829 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-11 03:30:23,831 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-11 03:30:23,831 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:23,840 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:23,841 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:23,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:23 BoogieIcfgContainer [2022-01-11 03:30:23,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:23,844 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:23,844 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:23,845 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:23,847 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:23" (1/1) ... [2022-01-11 03:30:23,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:23 BasicIcfg [2022-01-11 03:30:23,956 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:23,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:23,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:23,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:23,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:22" (1/4) ... [2022-01-11 03:30:23,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f9a2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:23, skipping insertion in model container [2022-01-11 03:30:23,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:23" (2/4) ... [2022-01-11 03:30:23,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f9a2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:23, skipping insertion in model container [2022-01-11 03:30:23,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:23" (3/4) ... [2022-01-11 03:30:23,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f9a2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:23, skipping insertion in model container [2022-01-11 03:30:23,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:23" (4/4) ... [2022-01-11 03:30:23,961 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.cTransformedIcfg [2022-01-11 03:30:23,964 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:23,964 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:23,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:23,998 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:30:23,998 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:24,012 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-01-11 03:30:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 03:30:24,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:24,018 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash -166737805, now seen corresponding path program 1 times [2022-01-11 03:30:24,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770652647] [2022-01-11 03:30:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:24,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770652647] [2022-01-11 03:30:24,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770652647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218851191] [2022-01-11 03:30:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,276 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-01-11 03:30:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,356 INFO L93 Difference]: Finished difference Result 404 states and 690 transitions. [2022-01-11 03:30:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,360 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-01-11 03:30:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,368 INFO L225 Difference]: With dead ends: 404 [2022-01-11 03:30:24,368 INFO L226 Difference]: Without dead ends: 245 [2022-01-11 03:30:24,370 INFO L932 BasicCegarLoop]: 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-01-11 03:30:24,372 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 186 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 447 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-01-11 03:30:24,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 447 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-11 03:30:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-01-11 03:30:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.528688524590164) internal successors, (373), 244 states have internal predecessors, (373), 0 states have call successors, (0), 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-01-11 03:30:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 373 transitions. [2022-01-11 03:30:24,425 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 373 transitions. Word has length 44 [2022-01-11 03:30:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,426 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 373 transitions. [2022-01-11 03:30:24,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 373 transitions. [2022-01-11 03:30:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 03:30:24,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,432 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 03:30:24,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:24,433 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash 219035330, now seen corresponding path program 1 times [2022-01-11 03:30:24,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634584624] [2022-01-11 03:30:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:24,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634584624] [2022-01-11 03:30:24,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634584624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287071337] [2022-01-11 03:30:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,516 INFO L87 Difference]: Start difference. First operand 245 states and 373 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-01-11 03:30:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,676 INFO L93 Difference]: Finished difference Result 394 states and 606 transitions. [2022-01-11 03:30:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-11 03:30:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,678 INFO L225 Difference]: With dead ends: 394 [2022-01-11 03:30:24,678 INFO L226 Difference]: Without dead ends: 274 [2022-01-11 03:30:24,678 INFO L932 BasicCegarLoop]: 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-01-11 03:30:24,679 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:24,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 308 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-01-11 03:30:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2022-01-11 03:30:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.5056603773584907) internal successors, (399), 265 states have internal predecessors, (399), 0 states have call successors, (0), 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-01-11 03:30:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2022-01-11 03:30:24,690 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 60 [2022-01-11 03:30:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,690 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2022-01-11 03:30:24,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2022-01-11 03:30:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 03:30:24,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,692 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:24,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:24,692 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash -113240745, now seen corresponding path program 1 times [2022-01-11 03:30:24,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355120663] [2022-01-11 03:30:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:24,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:24,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355120663] [2022-01-11 03:30:24,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355120663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:24,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:24,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:24,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033751257] [2022-01-11 03:30:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:24,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:24,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:24,758 INFO L87 Difference]: Start difference. First operand 266 states and 399 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-01-11 03:30:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:24,912 INFO L93 Difference]: Finished difference Result 618 states and 954 transitions. [2022-01-11 03:30:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:24,912 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 81 [2022-01-11 03:30:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:24,915 INFO L225 Difference]: With dead ends: 618 [2022-01-11 03:30:24,915 INFO L226 Difference]: Without dead ends: 360 [2022-01-11 03:30:24,920 INFO L932 BasicCegarLoop]: 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-01-11 03:30:24,923 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 16 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:24,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 309 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-01-11 03:30:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 350. [2022-01-11 03:30:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.4126074498567336) internal successors, (493), 349 states have internal predecessors, (493), 0 states have call successors, (0), 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-01-11 03:30:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 493 transitions. [2022-01-11 03:30:24,939 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 493 transitions. Word has length 81 [2022-01-11 03:30:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:24,940 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 493 transitions. [2022-01-11 03:30:24,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 493 transitions. [2022-01-11 03:30:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 03:30:24,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:24,942 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:24,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:24,942 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:24,942 INFO L85 PathProgramCache]: Analyzing trace with hash 10832502, now seen corresponding path program 1 times [2022-01-11 03:30:24,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:24,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671777556] [2022-01-11 03:30:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:24,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:25,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671777556] [2022-01-11 03:30:25,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671777556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956632947] [2022-01-11 03:30:25,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,013 INFO L87 Difference]: Start difference. First operand 350 states and 493 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-01-11 03:30:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,128 INFO L93 Difference]: Finished difference Result 746 states and 1068 transitions. [2022-01-11 03:30:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,128 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 81 [2022-01-11 03:30:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,130 INFO L225 Difference]: With dead ends: 746 [2022-01-11 03:30:25,131 INFO L226 Difference]: Without dead ends: 404 [2022-01-11 03:30:25,131 INFO L932 BasicCegarLoop]: 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-01-11 03:30:25,138 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 309 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-01-11 03:30:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2022-01-11 03:30:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.389873417721519) internal successors, (549), 395 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-01-11 03:30:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 549 transitions. [2022-01-11 03:30:25,153 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 549 transitions. Word has length 81 [2022-01-11 03:30:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,154 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 549 transitions. [2022-01-11 03:30:25,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 549 transitions. [2022-01-11 03:30:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-11 03:30:25,158 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,158 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:25,158 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1915224962, now seen corresponding path program 1 times [2022-01-11 03:30:25,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583197194] [2022-01-11 03:30:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-11 03:30:25,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583197194] [2022-01-11 03:30:25,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583197194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122053051] [2022-01-11 03:30:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,261 INFO L87 Difference]: Start difference. First operand 396 states and 549 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-01-11 03:30:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,381 INFO L93 Difference]: Finished difference Result 860 states and 1220 transitions. [2022-01-11 03:30:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-01-11 03:30:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,384 INFO L225 Difference]: With dead ends: 860 [2022-01-11 03:30:25,384 INFO L226 Difference]: Without dead ends: 472 [2022-01-11 03:30:25,384 INFO L932 BasicCegarLoop]: 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-01-11 03:30:25,385 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 308 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-01-11 03:30:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 446. [2022-01-11 03:30:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.3685393258426966) internal successors, (609), 445 states have internal predecessors, (609), 0 states have call successors, (0), 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-01-11 03:30:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 609 transitions. [2022-01-11 03:30:25,398 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 609 transitions. Word has length 102 [2022-01-11 03:30:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,400 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 609 transitions. [2022-01-11 03:30:25,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-01-11 03:30:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 609 transitions. [2022-01-11 03:30:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 03:30:25,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,409 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:25,410 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1115556810, now seen corresponding path program 1 times [2022-01-11 03:30:25,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254446649] [2022-01-11 03:30:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-11 03:30:25,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254446649] [2022-01-11 03:30:25,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254446649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419522692] [2022-01-11 03:30:25,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,473 INFO L87 Difference]: Start difference. First operand 446 states and 609 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-01-11 03:30:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,498 INFO L93 Difference]: Finished difference Result 677 states and 924 transitions. [2022-01-11 03:30:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,499 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-01-11 03:30:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,501 INFO L225 Difference]: With dead ends: 677 [2022-01-11 03:30:25,501 INFO L226 Difference]: Without dead ends: 675 [2022-01-11 03:30:25,501 INFO L932 BasicCegarLoop]: 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-01-11 03:30:25,502 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 148 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 362 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-11 03:30:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2022-01-11 03:30:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.367952522255193) internal successors, (922), 674 states have internal predecessors, (922), 0 states have call successors, (0), 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-01-11 03:30:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 922 transitions. [2022-01-11 03:30:25,513 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 922 transitions. Word has length 121 [2022-01-11 03:30:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,514 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 922 transitions. [2022-01-11 03:30:25,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 922 transitions. [2022-01-11 03:30:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-11 03:30:25,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,515 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:25,515 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1778099678, now seen corresponding path program 1 times [2022-01-11 03:30:25,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341334631] [2022-01-11 03:30:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:25,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341334631] [2022-01-11 03:30:25,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341334631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517393735] [2022-01-11 03:30:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,554 INFO L87 Difference]: Start difference. First operand 675 states and 922 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,577 INFO L93 Difference]: Finished difference Result 1361 states and 1859 transitions. [2022-01-11 03:30:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-01-11 03:30:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,580 INFO L225 Difference]: With dead ends: 1361 [2022-01-11 03:30:25,580 INFO L226 Difference]: Without dead ends: 901 [2022-01-11 03:30:25,580 INFO L932 BasicCegarLoop]: 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-01-11 03:30:25,581 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 551 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-01-11 03:30:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2022-01-11 03:30:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.3644444444444443) internal successors, (1228), 900 states have internal predecessors, (1228), 0 states have call successors, (0), 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-01-11 03:30:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1228 transitions. [2022-01-11 03:30:25,595 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1228 transitions. Word has length 122 [2022-01-11 03:30:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,595 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 1228 transitions. [2022-01-11 03:30:25,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1228 transitions. [2022-01-11 03:30:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-11 03:30:25,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,597 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:25,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:25,597 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1307625379, now seen corresponding path program 1 times [2022-01-11 03:30:25,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503218750] [2022-01-11 03:30:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-11 03:30:25,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503218750] [2022-01-11 03:30:25,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503218750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998640587] [2022-01-11 03:30:25,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,632 INFO L87 Difference]: Start difference. First operand 901 states and 1228 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-01-11 03:30:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,649 INFO L93 Difference]: Finished difference Result 1611 states and 2192 transitions. [2022-01-11 03:30:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,650 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-01-11 03:30:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,652 INFO L225 Difference]: With dead ends: 1611 [2022-01-11 03:30:25,652 INFO L226 Difference]: Without dead ends: 925 [2022-01-11 03:30:25,653 INFO L932 BasicCegarLoop]: 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-01-11 03:30:25,654 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-01-11 03:30:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2022-01-11 03:30:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.3603896103896105) internal successors, (1257), 924 states have internal predecessors, (1257), 0 states have call successors, (0), 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-01-11 03:30:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1257 transitions. [2022-01-11 03:30:25,671 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1257 transitions. Word has length 122 [2022-01-11 03:30:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,672 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1257 transitions. [2022-01-11 03:30:25,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1257 transitions. [2022-01-11 03:30:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 03:30:25,673 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,674 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:25,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:25,674 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1461059313, now seen corresponding path program 1 times [2022-01-11 03:30:25,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671713249] [2022-01-11 03:30:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-11 03:30:25,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671713249] [2022-01-11 03:30:25,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671713249] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939114044] [2022-01-11 03:30:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,737 INFO L87 Difference]: Start difference. First operand 925 states and 1257 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-01-11 03:30:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:25,878 INFO L93 Difference]: Finished difference Result 2011 states and 2797 transitions. [2022-01-11 03:30:25,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:25,879 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 162 [2022-01-11 03:30:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:25,882 INFO L225 Difference]: With dead ends: 2011 [2022-01-11 03:30:25,882 INFO L226 Difference]: Without dead ends: 1094 [2022-01-11 03:30:25,884 INFO L932 BasicCegarLoop]: 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-01-11 03:30:25,885 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 28 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:25,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 300 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-01-11 03:30:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1048. [2022-01-11 03:30:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.340974212034384) internal successors, (1404), 1047 states have internal predecessors, (1404), 0 states have call successors, (0), 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-01-11 03:30:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1404 transitions. [2022-01-11 03:30:25,905 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1404 transitions. Word has length 162 [2022-01-11 03:30:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:25,906 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1404 transitions. [2022-01-11 03:30:25,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1404 transitions. [2022-01-11 03:30:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-01-11 03:30:25,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:25,908 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1] [2022-01-11 03:30:25,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:25,908 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1300649855, now seen corresponding path program 1 times [2022-01-11 03:30:25,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:25,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159701582] [2022-01-11 03:30:25,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:25,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-11 03:30:25,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:25,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159701582] [2022-01-11 03:30:25,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159701582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:25,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:25,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:25,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417713700] [2022-01-11 03:30:25,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:25,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:25,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:25,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:25,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:25,973 INFO L87 Difference]: Start difference. First operand 1048 states and 1404 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-01-11 03:30:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:26,163 INFO L93 Difference]: Finished difference Result 2314 states and 3186 transitions. [2022-01-11 03:30:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 175 [2022-01-11 03:30:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:26,168 INFO L225 Difference]: With dead ends: 2314 [2022-01-11 03:30:26,168 INFO L226 Difference]: Without dead ends: 1270 [2022-01-11 03:30:26,170 INFO L932 BasicCegarLoop]: 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-01-11 03:30:26,171 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 160 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:26,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-01-11 03:30:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1252. [2022-01-11 03:30:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.3932853717026379) internal successors, (1743), 1251 states have internal predecessors, (1743), 0 states have call successors, (0), 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-01-11 03:30:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1743 transitions. [2022-01-11 03:30:26,194 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1743 transitions. Word has length 175 [2022-01-11 03:30:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:26,194 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1743 transitions. [2022-01-11 03:30:26,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-01-11 03:30:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1743 transitions. [2022-01-11 03:30:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-11 03:30:26,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:26,196 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:26,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:26,197 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash 990103062, now seen corresponding path program 1 times [2022-01-11 03:30:26,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:26,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769905273] [2022-01-11 03:30:26,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:26,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-01-11 03:30:26,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:26,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769905273] [2022-01-11 03:30:26,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769905273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:26,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:26,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:26,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935311419] [2022-01-11 03:30:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:26,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:26,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:26,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:26,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:26,263 INFO L87 Difference]: Start difference. First operand 1252 states and 1743 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-01-11 03:30:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:26,374 INFO L93 Difference]: Finished difference Result 2620 states and 3694 transitions. [2022-01-11 03:30:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:26,375 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 204 [2022-01-11 03:30:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:26,379 INFO L225 Difference]: With dead ends: 2620 [2022-01-11 03:30:26,379 INFO L226 Difference]: Without dead ends: 1376 [2022-01-11 03:30:26,382 INFO L932 BasicCegarLoop]: 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-01-11 03:30:26,382 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:26,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 290 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-01-11 03:30:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2022-01-11 03:30:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1375 states have (on average 1.3723636363636365) internal successors, (1887), 1375 states have internal predecessors, (1887), 0 states have call successors, (0), 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-01-11 03:30:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1887 transitions. [2022-01-11 03:30:26,407 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1887 transitions. Word has length 204 [2022-01-11 03:30:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:26,407 INFO L470 AbstractCegarLoop]: Abstraction has 1376 states and 1887 transitions. [2022-01-11 03:30:26,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1887 transitions. [2022-01-11 03:30:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 03:30:26,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:26,410 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:26,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:30:26,410 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:26,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:26,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2138547937, now seen corresponding path program 1 times [2022-01-11 03:30:26,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:26,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962943604] [2022-01-11 03:30:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:26,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-11 03:30:26,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:26,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962943604] [2022-01-11 03:30:26,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962943604] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:26,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035882872] [2022-01-11 03:30:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:26,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:26,518 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-01-11 03:30:26,543 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-01-11 03:30:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:26,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:26,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-11 03:30:27,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-11 03:30:27,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035882872] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:27,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:27,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:27,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623213459] [2022-01-11 03:30:27,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:27,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:27,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:27,247 INFO L87 Difference]: Start difference. First operand 1376 states and 1887 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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-01-11 03:30:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:27,514 INFO L93 Difference]: Finished difference Result 3358 states and 4608 transitions. [2022-01-11 03:30:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 03:30:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2022-01-11 03:30:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:27,520 INFO L225 Difference]: With dead ends: 3358 [2022-01-11 03:30:27,520 INFO L226 Difference]: Without dead ends: 1946 [2022-01-11 03:30:27,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:30:27,523 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 415 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:27,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 541 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2022-01-11 03:30:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1587. [2022-01-11 03:30:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1586 states have (on average 1.3430012610340478) internal successors, (2130), 1586 states have internal predecessors, (2130), 0 states have call successors, (0), 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-01-11 03:30:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2130 transitions. [2022-01-11 03:30:27,576 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2130 transitions. Word has length 232 [2022-01-11 03:30:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:27,576 INFO L470 AbstractCegarLoop]: Abstraction has 1587 states and 2130 transitions. [2022-01-11 03:30:27,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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-01-11 03:30:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2130 transitions. [2022-01-11 03:30:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-11 03:30:27,580 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:27,580 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:27,601 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-01-11 03:30:27,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-11 03:30:27,795 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1597280281, now seen corresponding path program 1 times [2022-01-11 03:30:27,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:27,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172949302] [2022-01-11 03:30:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:27,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 03:30:27,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172949302] [2022-01-11 03:30:27,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172949302] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478003456] [2022-01-11 03:30:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:27,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:27,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:27,868 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-01-11 03:30:27,920 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-01-11 03:30:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:28,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:28,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 03:30:28,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-11 03:30:28,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478003456] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:28,541 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:28,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:28,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395965649] [2022-01-11 03:30:28,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:28,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:28,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:28,542 INFO L87 Difference]: Start difference. First operand 1587 states and 2130 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-01-11 03:30:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:29,176 INFO L93 Difference]: Finished difference Result 6562 states and 9156 transitions. [2022-01-11 03:30:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 03:30:29,176 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-01-11 03:30:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:29,189 INFO L225 Difference]: With dead ends: 6562 [2022-01-11 03:30:29,189 INFO L226 Difference]: Without dead ends: 4983 [2022-01-11 03:30:29,192 INFO L932 BasicCegarLoop]: 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-01-11 03:30:29,193 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 450 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:29,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 1548 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:30:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2022-01-11 03:30:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 4107. [2022-01-11 03:30:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4107 states, 4106 states have (on average 1.3356064296151973) internal successors, (5484), 4106 states have internal predecessors, (5484), 0 states have call successors, (0), 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-01-11 03:30:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 5484 transitions. [2022-01-11 03:30:29,286 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 5484 transitions. Word has length 253 [2022-01-11 03:30:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:29,287 INFO L470 AbstractCegarLoop]: Abstraction has 4107 states and 5484 transitions. [2022-01-11 03:30:29,287 INFO L471 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-01-11 03:30:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5484 transitions. [2022-01-11 03:30:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-11 03:30:29,293 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,293 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:29,326 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-01-11 03:30:29,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-11 03:30:29,524 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1741689976, now seen corresponding path program 1 times [2022-01-11 03:30:29,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671503824] [2022-01-11 03:30:29,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-01-11 03:30:29,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671503824] [2022-01-11 03:30:29,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671503824] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:29,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:29,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414202895] [2022-01-11 03:30:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,573 INFO L87 Difference]: Start difference. First operand 4107 states and 5484 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-01-11 03:30:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:29,674 INFO L93 Difference]: Finished difference Result 10889 states and 14582 transitions. [2022-01-11 03:30:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:29,675 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-01-11 03:30:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:29,694 INFO L225 Difference]: With dead ends: 10889 [2022-01-11 03:30:29,695 INFO L226 Difference]: Without dead ends: 6790 [2022-01-11 03:30:29,702 INFO L932 BasicCegarLoop]: 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-01-11 03:30:29,703 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 131 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 547 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-01-11 03:30:29,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 547 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2022-01-11 03:30:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 6502. [2022-01-11 03:30:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6502 states, 6501 states have (on average 1.343331795108445) internal successors, (8733), 6501 states have internal predecessors, (8733), 0 states have call successors, (0), 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-01-11 03:30:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 8733 transitions. [2022-01-11 03:30:29,886 INFO L78 Accepts]: Start accepts. Automaton has 6502 states and 8733 transitions. Word has length 253 [2022-01-11 03:30:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:29,886 INFO L470 AbstractCegarLoop]: Abstraction has 6502 states and 8733 transitions. [2022-01-11 03:30:29,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6502 states and 8733 transitions. [2022-01-11 03:30:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-01-11 03:30:29,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:29,897 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-11 03:30:29,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:29,897 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1133710932, now seen corresponding path program 1 times [2022-01-11 03:30:29,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:29,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383919837] [2022-01-11 03:30:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:29,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-01-11 03:30:29,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:29,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383919837] [2022-01-11 03:30:29,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383919837] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:29,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:29,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:29,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092988839] [2022-01-11 03:30:29,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:29,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:29,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:29,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:29,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:29,953 INFO L87 Difference]: Start difference. First operand 6502 states and 8733 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,117 INFO L93 Difference]: Finished difference Result 11082 states and 15130 transitions. [2022-01-11 03:30:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2022-01-11 03:30:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,126 INFO L225 Difference]: With dead ends: 11082 [2022-01-11 03:30:30,127 INFO L226 Difference]: Without dead ends: 3161 [2022-01-11 03:30:30,136 INFO L932 BasicCegarLoop]: 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-01-11 03:30:30,136 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 26 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 308 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2022-01-11 03:30:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 2891. [2022-01-11 03:30:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2890 states have (on average 1.3321799307958477) internal successors, (3850), 2890 states have internal predecessors, (3850), 0 states have call successors, (0), 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-01-11 03:30:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 3850 transitions. [2022-01-11 03:30:30,222 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 3850 transitions. Word has length 290 [2022-01-11 03:30:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,223 INFO L470 AbstractCegarLoop]: Abstraction has 2891 states and 3850 transitions. [2022-01-11 03:30:30,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3850 transitions. [2022-01-11 03:30:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-01-11 03:30:30,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,228 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:30,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:30:30,228 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1995995970, now seen corresponding path program 1 times [2022-01-11 03:30:30,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480057335] [2022-01-11 03:30:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2022-01-11 03:30:30,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480057335] [2022-01-11 03:30:30,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480057335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408256475] [2022-01-11 03:30:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,280 INFO L87 Difference]: Start difference. First operand 2891 states and 3850 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,348 INFO L93 Difference]: Finished difference Result 8587 states and 11396 transitions. [2022-01-11 03:30:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2022-01-11 03:30:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,361 INFO L225 Difference]: With dead ends: 8587 [2022-01-11 03:30:30,361 INFO L226 Difference]: Without dead ends: 5704 [2022-01-11 03:30:30,372 INFO L932 BasicCegarLoop]: 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-01-11 03:30:30,372 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 177 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 523 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2022-01-11 03:30:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 2901. [2022-01-11 03:30:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2900 states have (on average 1.3310344827586207) internal successors, (3860), 2900 states have internal predecessors, (3860), 0 states have call successors, (0), 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-01-11 03:30:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3860 transitions. [2022-01-11 03:30:30,464 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3860 transitions. Word has length 337 [2022-01-11 03:30:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,465 INFO L470 AbstractCegarLoop]: Abstraction has 2901 states and 3860 transitions. [2022-01-11 03:30:30,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3860 transitions. [2022-01-11 03:30:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-01-11 03:30:30,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,471 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:30,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 03:30:30,471 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1505968769, now seen corresponding path program 1 times [2022-01-11 03:30:30,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103272063] [2022-01-11 03:30:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2022-01-11 03:30:30,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103272063] [2022-01-11 03:30:30,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103272063] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647506025] [2022-01-11 03:30:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,566 INFO L87 Difference]: Start difference. First operand 2901 states and 3860 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-01-11 03:30:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,697 INFO L93 Difference]: Finished difference Result 6132 states and 8206 transitions. [2022-01-11 03:30:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2022-01-11 03:30:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,703 INFO L225 Difference]: With dead ends: 6132 [2022-01-11 03:30:30,703 INFO L226 Difference]: Without dead ends: 3239 [2022-01-11 03:30:30,707 INFO L932 BasicCegarLoop]: 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-01-11 03:30:30,707 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 303 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-01-11 03:30:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3171. [2022-01-11 03:30:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 3170 states have (on average 1.3186119873817035) internal successors, (4180), 3170 states have internal predecessors, (4180), 0 states have call successors, (0), 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-01-11 03:30:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4180 transitions. [2022-01-11 03:30:30,772 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4180 transitions. Word has length 337 [2022-01-11 03:30:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,773 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 4180 transitions. [2022-01-11 03:30:30,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4180 transitions. [2022-01-11 03:30:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-01-11 03:30:30,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,778 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:30,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 03:30:30,778 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1545041225, now seen corresponding path program 1 times [2022-01-11 03:30:30,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004607049] [2022-01-11 03:30:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-01-11 03:30:30,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004607049] [2022-01-11 03:30:30,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004607049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761961785] [2022-01-11 03:30:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,854 INFO L87 Difference]: Start difference. First operand 3171 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,979 INFO L93 Difference]: Finished difference Result 6463 states and 8517 transitions. [2022-01-11 03:30:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2022-01-11 03:30:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,984 INFO L225 Difference]: With dead ends: 6463 [2022-01-11 03:30:30,984 INFO L226 Difference]: Without dead ends: 3300 [2022-01-11 03:30:30,988 INFO L932 BasicCegarLoop]: 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-01-11 03:30:30,988 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 303 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2022-01-11 03:30:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2372. [2022-01-11 03:30:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2371 states have (on average 1.309995782370308) internal successors, (3106), 2371 states have internal predecessors, (3106), 0 states have call successors, (0), 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-01-11 03:30:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3106 transitions. [2022-01-11 03:30:31,064 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3106 transitions. Word has length 360 [2022-01-11 03:30:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,065 INFO L470 AbstractCegarLoop]: Abstraction has 2372 states and 3106 transitions. [2022-01-11 03:30:31,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3106 transitions. [2022-01-11 03:30:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-01-11 03:30:31,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,070 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:31,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 03:30:31,070 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -827974730, now seen corresponding path program 1 times [2022-01-11 03:30:31,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815019787] [2022-01-11 03:30:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-01-11 03:30:31,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815019787] [2022-01-11 03:30:31,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815019787] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:31,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847313559] [2022-01-11 03:30:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:31,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:31,137 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-01-11 03:30:31,138 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-01-11 03:30:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:31,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-01-11 03:30:32,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:32,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847313559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:32,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:32,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:32,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853720980] [2022-01-11 03:30:32,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:32,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:32,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:32,242 INFO L87 Difference]: Start difference. First operand 2372 states and 3106 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-01-11 03:30:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,302 INFO L93 Difference]: Finished difference Result 2846 states and 3725 transitions. [2022-01-11 03:30:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,303 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-01-11 03:30:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,307 INFO L225 Difference]: With dead ends: 2846 [2022-01-11 03:30:32,307 INFO L226 Difference]: Without dead ends: 2708 [2022-01-11 03:30:32,308 INFO L932 BasicCegarLoop]: 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-01-11 03:30:32,309 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 90 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:32,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 529 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2022-01-11 03:30:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2236. [2022-01-11 03:30:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2235 states have (on average 1.3208053691275168) internal successors, (2952), 2235 states have internal predecessors, (2952), 0 states have call successors, (0), 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-01-11 03:30:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2952 transitions. [2022-01-11 03:30:32,361 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2952 transitions. Word has length 393 [2022-01-11 03:30:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,362 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2952 transitions. [2022-01-11 03:30:32,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2952 transitions. [2022-01-11 03:30:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2022-01-11 03:30:32,367 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,367 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:32,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-11 03:30:32,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:32,584 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1335944484, now seen corresponding path program 1 times [2022-01-11 03:30:32,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:32,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270708305] [2022-01-11 03:30:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-01-11 03:30:32,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270708305] [2022-01-11 03:30:32,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270708305] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110482674] [2022-01-11 03:30:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:32,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:32,660 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-01-11 03:30:32,661 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-01-11 03:30:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:32,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-01-11 03:30:33,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-01-11 03:30:33,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110482674] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:33,825 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:33,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:33,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753204509] [2022-01-11 03:30:33,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:33,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:33,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:33,826 INFO L87 Difference]: Start difference. First operand 2236 states and 2952 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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-01-11 03:30:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:34,155 INFO L93 Difference]: Finished difference Result 5119 states and 6748 transitions. [2022-01-11 03:30:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:30:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2022-01-11 03:30:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:34,163 INFO L225 Difference]: With dead ends: 5119 [2022-01-11 03:30:34,163 INFO L226 Difference]: Without dead ends: 2844 [2022-01-11 03:30:34,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 818 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-01-11 03:30:34,166 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 417 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:34,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 583 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:30:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2022-01-11 03:30:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2369. [2022-01-11 03:30:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2368 states have (on average 1.3247466216216217) internal successors, (3137), 2368 states have internal predecessors, (3137), 0 states have call successors, (0), 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-01-11 03:30:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3137 transitions. [2022-01-11 03:30:34,211 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3137 transitions. Word has length 409 [2022-01-11 03:30:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:34,211 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 3137 transitions. [2022-01-11 03:30:34,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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-01-11 03:30:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3137 transitions. [2022-01-11 03:30:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2022-01-11 03:30:34,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:34,218 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-11 03:30:34,238 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-01-11 03:30:34,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:34,430 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1920918788, now seen corresponding path program 1 times [2022-01-11 03:30:34,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:34,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455273109] [2022-01-11 03:30:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:34,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-01-11 03:30:34,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:34,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455273109] [2022-01-11 03:30:34,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455273109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:34,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:34,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:34,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321074501] [2022-01-11 03:30:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:34,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:34,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:34,505 INFO L87 Difference]: Start difference. First operand 2369 states and 3137 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:34,617 INFO L93 Difference]: Finished difference Result 5054 states and 6739 transitions. [2022-01-11 03:30:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2022-01-11 03:30:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:34,621 INFO L225 Difference]: With dead ends: 5054 [2022-01-11 03:30:34,621 INFO L226 Difference]: Without dead ends: 2693 [2022-01-11 03:30:34,623 INFO L932 BasicCegarLoop]: 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-01-11 03:30:34,623 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:34,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 302 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2022-01-11 03:30:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2675. [2022-01-11 03:30:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2674 states have (on average 1.3044128646222888) internal successors, (3488), 2674 states have internal predecessors, (3488), 0 states have call successors, (0), 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-01-11 03:30:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3488 transitions. [2022-01-11 03:30:34,696 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3488 transitions. Word has length 537 [2022-01-11 03:30:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:34,696 INFO L470 AbstractCegarLoop]: Abstraction has 2675 states and 3488 transitions. [2022-01-11 03:30:34,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3488 transitions. [2022-01-11 03:30:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-01-11 03:30:34,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:34,705 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:34,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 03:30:34,705 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1766088430, now seen corresponding path program 1 times [2022-01-11 03:30:34,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:34,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908390484] [2022-01-11 03:30:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:34,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-11 03:30:34,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:34,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908390484] [2022-01-11 03:30:34,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908390484] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:34,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326604834] [2022-01-11 03:30:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:34,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:34,828 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-01-11 03:30:34,829 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-01-11 03:30:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:35,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 2203 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:35,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-11 03:30:35,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-11 03:30:36,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326604834] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:36,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:36,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:36,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641157337] [2022-01-11 03:30:36,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:36,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:36,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:36,407 INFO L87 Difference]: Start difference. First operand 2675 states and 3488 transitions. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 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-01-11 03:30:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:36,731 INFO L93 Difference]: Finished difference Result 4432 states and 5781 transitions. [2022-01-11 03:30:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 03:30:36,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 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) Word has length 599 [2022-01-11 03:30:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:36,732 INFO L225 Difference]: With dead ends: 4432 [2022-01-11 03:30:36,732 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:36,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 03:30:36,736 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 217 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:36,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 656 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:30:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:36,739 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-01-11 03:30:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:36,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2022-01-11 03:30:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:36,740 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:36,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 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-01-11 03:30:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:36,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:36,742 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:36,769 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-01-11 03:30:36,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-11 03:30:36,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:30:43,764 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,764 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,765 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:30:43,765 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:30:43,765 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-11 03:30:43,765 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-11 03:30:43,765 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-11 03:30:43,766 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2022-01-11 03:30:43,766 INFO L861 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2022-01-11 03:30:43,767 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse6 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (.cse9 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse4 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse12 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse15 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse3 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse8 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640)) (.cse11 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse3 .cse0 .cse4) (and .cse5 .cse6) (and .cse0 .cse6) (and .cse3 .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse1 .cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse2 .cse11) (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse12 .cse0 .cse1 .cse2) (and .cse0 .cse13 .cse7 .cse1 .cse9 .cse2) (and .cse0 .cse13 .cse4) (and .cse12 .cse0 .cse1 .cse2 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 .cse13 .cse1 .cse2 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse14 .cse13 .cse10 .cse15) (and .cse3 .cse14 .cse10 .cse15) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .cse0 .cse13 .cse7 .cse1 .cse2) (and .cse3 .cse8 .cse5 .cse11) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:43,767 INFO L861 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2022-01-11 03:30:43,767 INFO L861 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-01-11 03:30:43,767 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-11 03:30:43,768 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,768 INFO L858 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2022-01-11 03:30:43,768 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2022-01-11 03:30:43,768 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:30:43,768 INFO L858 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2022-01-11 03:30:43,768 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: (and (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) [2022-01-11 03:30:43,768 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576))) (or (and .cse0 .cse1) (and (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse1) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse0))) [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2022-01-11 03:30:43,769 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-11 03:30:43,770 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:43,770 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2022-01-11 03:30:43,770 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-11 03:30:43,770 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:43,770 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-11 03:30:43,770 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2022-01-11 03:30:43,770 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-11 03:30:43,770 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-11 03:30:43,771 INFO L854 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse6 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3)) (.cse9 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse4 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse12 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse15 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse3 (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|))) (.cse8 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640)) (.cse11 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse3 .cse0 .cse4) (and .cse5 .cse6) (and .cse0 .cse6) (and .cse3 .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse1 .cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse2 .cse11) (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse12 .cse0 .cse1 .cse2) (and .cse0 .cse13 .cse7 .cse1 .cse9 .cse2) (and .cse0 .cse13 .cse4) (and .cse12 .cse0 .cse1 .cse2 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 .cse13 .cse1 .cse2 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse14 .cse13 .cse10 .cse15) (and .cse3 .cse14 .cse10 .cse15) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .cse0 .cse13 .cse7 .cse1 .cse2) (and .cse3 .cse8 .cse5 .cse11) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:43,772 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0))) [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0))) [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-01-11 03:30:43,772 INFO L858 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 1) .cse0) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-01-11 03:30:43,773 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-01-11 03:30:43,774 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-01-11 03:30:43,774 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,774 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2022-01-11 03:30:43,774 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-01-11 03:30:43,774 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2022-01-11 03:30:43,774 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:43,774 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,774 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2022-01-11 03:30:43,774 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,775 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse1 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-01-11 03:30:43,775 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (.cse1 (not (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8496)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0) .cse1))) [2022-01-11 03:30:43,776 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (.cse0 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) .cse0) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse2 .cse0) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1 .cse2 .cse0) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640) .cse0))) [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (< 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (.cse1 (not (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)))) [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-01-11 03:30:43,776 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656)) (.cse1 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int| 0)) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8640) (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8640) .cse1))) [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse1 (<= 8640 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse2 .cse1) (and .cse0 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse1))) [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 502) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 510) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L507-2(lines 219 553) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2022-01-11 03:30:43,777 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L854 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: true [2022-01-11 03:30:43,778 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: true [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2022-01-11 03:30:43,778 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2022-01-11 03:30:43,780 INFO L732 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] [2022-01-11 03:30:43,781 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:43,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:43 BasicIcfg [2022-01-11 03:30:43,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:43,837 INFO L158 Benchmark]: Toolchain (without parser) took 20842.24ms. Allocated memory was 176.2MB in the beginning and 532.7MB in the end (delta: 356.5MB). Free memory was 118.6MB in the beginning and 342.3MB in the end (delta: -223.7MB). Peak memory consumption was 308.4MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,837 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:43,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.24ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 118.4MB in the beginning and 217.6MB in the end (delta: -99.3MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.25ms. Allocated memory is still 249.6MB. Free memory was 217.6MB in the beginning and 214.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,838 INFO L158 Benchmark]: Boogie Preprocessor took 31.29ms. Allocated memory is still 249.6MB. Free memory was 214.5MB in the beginning and 212.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,838 INFO L158 Benchmark]: RCFGBuilder took 496.33ms. Allocated memory is still 249.6MB. Free memory was 212.4MB in the beginning and 184.6MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,838 INFO L158 Benchmark]: IcfgTransformer took 111.31ms. Allocated memory is still 249.6MB. Free memory was 184.6MB in the beginning and 170.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,838 INFO L158 Benchmark]: TraceAbstraction took 19880.26ms. Allocated memory was 249.6MB in the beginning and 532.7MB in the end (delta: 283.1MB). Free memory was 170.4MB in the beginning and 342.3MB in the end (delta: -171.9MB). Peak memory consumption was 286.4MB. Max. memory is 8.0GB. [2022-01-11 03:30:43,839 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.12ms. Allocated memory is still 176.2MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.24ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 118.4MB in the beginning and 217.6MB in the end (delta: -99.3MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.25ms. Allocated memory is still 249.6MB. Free memory was 217.6MB in the beginning and 214.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.29ms. Allocated memory is still 249.6MB. Free memory was 214.5MB in the beginning and 212.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 496.33ms. Allocated memory is still 249.6MB. Free memory was 212.4MB in the beginning and 184.6MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * IcfgTransformer took 111.31ms. Allocated memory is still 249.6MB. Free memory was 184.6MB in the beginning and 170.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19880.26ms. Allocated memory was 249.6MB in the beginning and 532.7MB in the end (delta: 283.1MB). Free memory was 170.4MB in the beginning and 342.3MB in the end (delta: -171.9MB). Peak memory consumption was 286.4MB. Max. memory is 8.0GB. * 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: 19.8s, OverallIterations: 22, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2711 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2711 mSDsluCounter, 9890 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4382 mSDsCounter, 604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3478 IncrementalHoareTripleChecker+Invalid, 4082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 604 mSolverCounterUnsat, 5508 mSDtfsCounter, 3478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3461 GetRequests, 3415 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6502occurred in iteration=14, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 6673 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 298 NumberOfFragments, 1090 HoareAnnotationTreeSize, 28 FomulaSimplifications, 31635 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 42349 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 7160 NumberOfCodeBlocks, 7160 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 8622 ConstructedInterpolants, 0 QuantifiedInterpolants, 13383 SizeOfPredicates, 5 NumberOfNonLiveVariables, 7108 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 31 InterpolantComputations, 18 PerfectInterpolantSequences, 32438/32746 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: ((~bvule32(blastFlag, 0bv32) && ~bvult64(8496bv32, s__state)) && !~bvule32(8576bv32, s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && !~bvule32(8576bv32, s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvule32(s__state, 8640bv32)) || (~bvule32(s__s3__tmp__next_state___0, 8640bv32) && ~bvule32(s__state, 8640bv32))) || (blastFlag == 2bv32 && ~bvule32(s__state, 8640bv32)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((blastFlag == 2bv32 && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || (((!(s__hit == 0bv32) && blastFlag == 2bv32) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 0bv32) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((blastFlag == 2bv32 && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && !~bvule32(8576bv32, s__state)) || ((!~bvule32(s__state, 8496bv32) && ~bvule32(blastFlag, 0bv32)) && !~bvule32(8576bv32, s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && !~bvule32(8640bv32, s__state)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && !~bvule32(8640bv32, s__state)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(blastFlag, 0bv32) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((blastFlag == 2bv32 && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((!(s__hit == 0bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || ((((!(s__hit == 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32))) || (((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8640bv32)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(s__state, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32))) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32))) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || ((((~bvule32(blastFlag, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state)) || (((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(s__state, 3bv32) && blastFlag == 2bv32)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8656bv32 == s__state) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8576bv32)) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8640bv32, s__state))) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) && 8448bv32 == s__state) || (((!(s__hit == 0bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((((~bvule32(blastFlag, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && !~bvule32(8640bv32, s__state)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && !~bvule32(8640bv32, s__state)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(8496bv32, s__state)) && !~bvule32(8576bv32, s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && !~bvule32(8576bv32, s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(8496bv32, s__state)) && !~bvule32(8576bv32, s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && !~bvule32(8576bv32, s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(8496bv32, s__state)) && !~bvule32(8576bv32, s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && !~bvule32(8576bv32, s__state)) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((blastFlag == 2bv32 && !~bvule32(s__state, 8496bv32)) && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && !~bvule32(8576bv32, s__state)) || ((!~bvule32(s__state, 8496bv32) && ~bvule32(blastFlag, 0bv32)) && !~bvule32(8576bv32, s__state)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && !~bvule32(8640bv32, s__state)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) || ((~bvule32(blastFlag, 0bv32) && !~bvule32(8640bv32, s__state)) && ~bvult64(8496bv32, s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || (blastFlag == 1bv32 && !~bvule32(8576bv32, s__state))) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((!(s__hit == 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32)) || (((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(8640bv32, s__state)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(8496bv32, s__state)) && !~bvule32(8576bv32, s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && !~bvule32(8576bv32, s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(blastFlag, 0bv32) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && 8528bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((blastFlag == 2bv32 && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((!(s__hit == 0bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0))) || ((((!(s__hit == 0bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32)) && ~bvule32(8640bv32, s__s3__tmp__next_state___0)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32))) || (((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__state, 8640bv32)) && ~bvult64(8496bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && 8512bv32 == s__state) && ~bvule32(0bv32, s__hit))) || (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(s__state, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 8640bv32))) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32))) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 8544bv32 == s__state)) || ((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvult64(8496bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 8560bv32 == s__state)) || ((((~bvule32(blastFlag, 3bv32) && ~bvule32(s__hit, 0bv32)) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && ~bvule32(0bv32, s__hit)) && 8448bv32 == s__state)) || (((((blastFlag == 2bv32 && ~bvule32(s__hit, 0bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(8640bv32, s__state)) && ~bvule32(s__state, 8640bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(s__state, 3bv32) && blastFlag == 2bv32)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8656bv32 == s__state) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:30:43,905 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...