/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_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:00,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:00,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:00,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:00,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:00,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:00,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:00,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:00,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:00,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:00,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:00,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:00,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:00,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:00,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:00,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:00,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:00,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:00,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:00,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:00,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:00,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:00,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:00,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:00,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:00,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:00,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:00,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:00,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:00,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:00,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:00,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:00,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:00,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:00,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:00,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:00,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:00,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:00,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:00,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:00,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:00,737 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:00,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:00,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:00,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:00,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:00,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:00,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:00,776 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:00,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:00,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:00,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:00,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:00,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:00,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:00,778 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:00,778 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:00,778 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:00,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:00,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:00,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:00,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:00,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:00,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:00,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:00,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:00,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:00,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:00,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:00,781 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:00,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:00,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:00,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:00,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:00,782 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:00,782 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:01,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:01,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:01,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:01,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:01,033 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:01,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c [2022-01-11 03:30:01,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a77e096e/23938b31e17749ad9291f839d8392352/FLAG069515a6e [2022-01-11 03:30:01,513 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:01,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c [2022-01-11 03:30:01,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a77e096e/23938b31e17749ad9291f839d8392352/FLAG069515a6e [2022-01-11 03:30:01,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a77e096e/23938b31e17749ad9291f839d8392352 [2022-01-11 03:30:01,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:01,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:01,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:01,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:01,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:01,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:01" (1/1) ... [2022-01-11 03:30:01,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18462bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:01, skipping insertion in model container [2022-01-11 03:30:01,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:01" (1/1) ... [2022-01-11 03:30:01,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:01,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:02,127 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_clnt_3.cil-3.c[37595,37608] [2022-01-11 03:30:02,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:02,139 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:02,177 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_clnt_3.cil-3.c[37595,37608] [2022-01-11 03:30:02,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:02,190 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:02,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:02 WrapperNode [2022-01-11 03:30:02,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:02,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:02,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:02,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:02,197 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:02" (1/1) ... [2022-01-11 03:30:02,205 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:02" (1/1) ... [2022-01-11 03:30:02,237 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 481 [2022-01-11 03:30:02,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:02,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:02,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:02,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:02,245 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:02" (1/1) ... [2022-01-11 03:30:02,246 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:02" (1/1) ... [2022-01-11 03:30:02,249 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:02" (1/1) ... [2022-01-11 03:30:02,250 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:02" (1/1) ... [2022-01-11 03:30:02,257 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:02" (1/1) ... [2022-01-11 03:30:02,272 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:02" (1/1) ... [2022-01-11 03:30:02,274 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:02" (1/1) ... [2022-01-11 03:30:02,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:02,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:02,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:02,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:02,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:02" (1/1) ... [2022-01-11 03:30:02,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:02,331 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:02,338 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:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:02,434 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:02,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:02,446 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:30:02,911 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-11 03:30:02,911 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-11 03:30:02,911 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:02,917 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:02,917 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:02,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:02 BoogieIcfgContainer [2022-01-11 03:30:02,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:02,920 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:02,920 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:02,923 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:02,926 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:02" (1/1) ... [2022-01-11 03:30:03,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:03 BasicIcfg [2022-01-11 03:30:03,131 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:03,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:03,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:03,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:03,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:01" (1/4) ... [2022-01-11 03:30:03,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264e3656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:03, skipping insertion in model container [2022-01-11 03:30:03,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:02" (2/4) ... [2022-01-11 03:30:03,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264e3656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:03, skipping insertion in model container [2022-01-11 03:30:03,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:02" (3/4) ... [2022-01-11 03:30:03,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264e3656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:03, skipping insertion in model container [2022-01-11 03:30:03,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:03" (4/4) ... [2022-01-11 03:30:03,141 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.cTransformedIcfg [2022-01-11 03:30:03,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:03,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:03,195 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:03,200 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:03,201 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 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:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:30:03,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:03,223 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] [2022-01-11 03:30:03,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1955201792, now seen corresponding path program 1 times [2022-01-11 03:30:03,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:03,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153862852] [2022-01-11 03:30:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:03,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:03,456 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:03,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:03,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153862852] [2022-01-11 03:30:03,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153862852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:03,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:03,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:03,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577020278] [2022-01-11 03:30:03,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:03,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:03,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:03,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:03,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:03,489 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:03,584 INFO L93 Difference]: Finished difference Result 366 states and 620 transitions. [2022-01-11 03:30:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 03:30:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:03,604 INFO L225 Difference]: With dead ends: 366 [2022-01-11 03:30:03,604 INFO L226 Difference]: Without dead ends: 213 [2022-01-11 03:30:03,606 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:03,611 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 179 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:03,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-01-11 03:30:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-01-11 03:30:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 0 states have call successors, (0), 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:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-01-11 03:30:03,676 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-01-11 03:30:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:03,677 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-01-11 03:30:03,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-01-11 03:30:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 03:30:03,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:03,680 INFO L514 BasicCegarLoop]: trace histogram [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:03,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:03,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash -206431364, now seen corresponding path program 1 times [2022-01-11 03:30:03,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:03,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645992080] [2022-01-11 03:30:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:03,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:03,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:03,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645992080] [2022-01-11 03:30:03,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645992080] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:03,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:03,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:03,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866602614] [2022-01-11 03:30:03,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:03,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:03,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:03,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:03,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:03,802 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:03,956 INFO L93 Difference]: Finished difference Result 345 states and 519 transitions. [2022-01-11 03:30:03,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:03,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-01-11 03:30:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:03,958 INFO L225 Difference]: With dead ends: 345 [2022-01-11 03:30:03,959 INFO L226 Difference]: Without dead ends: 240 [2022-01-11 03:30:03,993 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:03,994 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:03,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 260 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-11 03:30:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 230. [2022-01-11 03:30:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.480349344978166) internal successors, (339), 229 states have internal predecessors, (339), 0 states have call successors, (0), 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:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2022-01-11 03:30:04,011 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 38 [2022-01-11 03:30:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,011 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2022-01-11 03:30:04,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2022-01-11 03:30:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 03:30:04,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,013 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:04,014 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1673793400, now seen corresponding path program 1 times [2022-01-11 03:30:04,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836597945] [2022-01-11 03:30:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 03:30:04,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836597945] [2022-01-11 03:30:04,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836597945] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:04,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904837119] [2022-01-11 03:30:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:04,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:04,119 INFO L87 Difference]: Start difference. First operand 230 states and 339 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:04,268 INFO L93 Difference]: Finished difference Result 503 states and 750 transitions. [2022-01-11 03:30:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:04,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 55 [2022-01-11 03:30:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:04,274 INFO L225 Difference]: With dead ends: 503 [2022-01-11 03:30:04,274 INFO L226 Difference]: Without dead ends: 280 [2022-01-11 03:30:04,276 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:04,277 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:04,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 262 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-01-11 03:30:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2022-01-11 03:30:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.446096654275093) internal successors, (389), 269 states have internal predecessors, (389), 0 states have call successors, (0), 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:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 389 transitions. [2022-01-11 03:30:04,297 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 389 transitions. Word has length 55 [2022-01-11 03:30:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,298 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 389 transitions. [2022-01-11 03:30:04,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 389 transitions. [2022-01-11 03:30:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 03:30:04,305 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,305 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:04,305 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1376409415, now seen corresponding path program 1 times [2022-01-11 03:30:04,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337112855] [2022-01-11 03:30:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 03:30:04,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337112855] [2022-01-11 03:30:04,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337112855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:04,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199945509] [2022-01-11 03:30:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:04,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:04,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:04,418 INFO L87 Difference]: Start difference. First operand 270 states and 389 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:04,594 INFO L93 Difference]: Finished difference Result 633 states and 943 transitions. [2022-01-11 03:30:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 55 [2022-01-11 03:30:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:04,596 INFO L225 Difference]: With dead ends: 633 [2022-01-11 03:30:04,596 INFO L226 Difference]: Without dead ends: 368 [2022-01-11 03:30:04,598 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:04,601 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:04,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 225 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-01-11 03:30:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 350. [2022-01-11 03:30:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.3954154727793697) internal successors, (487), 349 states have internal predecessors, (487), 0 states have call successors, (0), 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:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 487 transitions. [2022-01-11 03:30:04,615 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 487 transitions. Word has length 55 [2022-01-11 03:30:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,616 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 487 transitions. [2022-01-11 03:30:04,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 487 transitions. [2022-01-11 03:30:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 03:30:04,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,618 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:04,619 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:04,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,619 INFO L85 PathProgramCache]: Analyzing trace with hash 728612485, now seen corresponding path program 1 times [2022-01-11 03:30:04,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709149730] [2022-01-11 03:30:04,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-11 03:30:04,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709149730] [2022-01-11 03:30:04,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709149730] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:04,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022118481] [2022-01-11 03:30:04,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:04,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:04,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:04,699 INFO L87 Difference]: Start difference. First operand 350 states and 487 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:04,845 INFO L93 Difference]: Finished difference Result 832 states and 1184 transitions. [2022-01-11 03:30:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:04,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:04,850 INFO L225 Difference]: With dead ends: 832 [2022-01-11 03:30:04,850 INFO L226 Difference]: Without dead ends: 487 [2022-01-11 03:30:04,851 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:04,853 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 127 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:04,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 173 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-01-11 03:30:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 461. [2022-01-11 03:30:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.4304347826086956) internal successors, (658), 460 states have internal predecessors, (658), 0 states have call successors, (0), 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:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 658 transitions. [2022-01-11 03:30:04,867 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 658 transitions. Word has length 81 [2022-01-11 03:30:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,867 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 658 transitions. [2022-01-11 03:30:04,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 658 transitions. [2022-01-11 03:30:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 03:30:04,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,870 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:04,870 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1395994320, now seen corresponding path program 1 times [2022-01-11 03:30:04,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065352960] [2022-01-11 03:30:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-11 03:30:04,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065352960] [2022-01-11 03:30:04,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065352960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:04,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204661889] [2022-01-11 03:30:04,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:04,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:04,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:04,961 INFO L87 Difference]: Start difference. First operand 461 states and 658 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,088 INFO L93 Difference]: Finished difference Result 930 states and 1345 transitions. [2022-01-11 03:30:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:05,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-11 03:30:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,091 INFO L225 Difference]: With dead ends: 930 [2022-01-11 03:30:05,091 INFO L226 Difference]: Without dead ends: 509 [2022-01-11 03:30:05,092 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:05,093 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:05,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 262 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-01-11 03:30:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 503. [2022-01-11 03:30:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.4143426294820718) internal successors, (710), 502 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 710 transitions. [2022-01-11 03:30:05,107 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 710 transitions. Word has length 85 [2022-01-11 03:30:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,107 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 710 transitions. [2022-01-11 03:30:05,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 710 transitions. [2022-01-11 03:30:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 03:30:05,109 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,109 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:05,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:05,110 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash -415148971, now seen corresponding path program 1 times [2022-01-11 03:30:05,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174977400] [2022-01-11 03:30:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-11 03:30:05,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174977400] [2022-01-11 03:30:05,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174977400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:05,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:05,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:05,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152270643] [2022-01-11 03:30:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:05,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:05,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:05,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:05,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:05,213 INFO L87 Difference]: Start difference. First operand 503 states and 710 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,244 INFO L93 Difference]: Finished difference Result 985 states and 1403 transitions. [2022-01-11 03:30:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:05,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-11 03:30:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,249 INFO L225 Difference]: With dead ends: 985 [2022-01-11 03:30:05,249 INFO L226 Difference]: Without dead ends: 743 [2022-01-11 03:30:05,250 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:05,251 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 136 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:05,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 307 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-01-11 03:30:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2022-01-11 03:30:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.4191374663072776) internal successors, (1053), 742 states have internal predecessors, (1053), 0 states have call successors, (0), 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:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1053 transitions. [2022-01-11 03:30:05,270 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1053 transitions. Word has length 105 [2022-01-11 03:30:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,271 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1053 transitions. [2022-01-11 03:30:05,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1053 transitions. [2022-01-11 03:30:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 03:30:05,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,273 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:05,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:05,274 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:05,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1817883518, now seen corresponding path program 1 times [2022-01-11 03:30:05,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937829927] [2022-01-11 03:30:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-11 03:30:05,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:05,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937829927] [2022-01-11 03:30:05,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937829927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:05,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:05,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:05,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711218495] [2022-01-11 03:30:05,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:05,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:05,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:05,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:05,342 INFO L87 Difference]: Start difference. First operand 743 states and 1053 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,372 INFO L93 Difference]: Finished difference Result 985 states and 1400 transitions. [2022-01-11 03:30:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:05,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-11 03:30:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,377 INFO L225 Difference]: With dead ends: 985 [2022-01-11 03:30:05,377 INFO L226 Difference]: Without dead ends: 983 [2022-01-11 03:30:05,377 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:05,378 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:05,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-01-11 03:30:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2022-01-11 03:30:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 1.4236252545824848) internal successors, (1398), 982 states have internal predecessors, (1398), 0 states have call successors, (0), 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:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1398 transitions. [2022-01-11 03:30:05,407 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1398 transitions. Word has length 107 [2022-01-11 03:30:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,407 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1398 transitions. [2022-01-11 03:30:05,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1398 transitions. [2022-01-11 03:30:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 03:30:05,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,413 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:05,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:05,413 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1100801225, now seen corresponding path program 1 times [2022-01-11 03:30:05,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765344152] [2022-01-11 03:30:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-11 03:30:05,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:05,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765344152] [2022-01-11 03:30:05,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765344152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:05,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:05,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:05,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450405699] [2022-01-11 03:30:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:05,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:05,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:05,505 INFO L87 Difference]: Start difference. First operand 983 states and 1398 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,657 INFO L93 Difference]: Finished difference Result 2130 states and 3088 transitions. [2022-01-11 03:30:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,662 INFO L225 Difference]: With dead ends: 2130 [2022-01-11 03:30:05,662 INFO L226 Difference]: Without dead ends: 1179 [2022-01-11 03:30:05,664 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:05,666 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 79 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:05,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 207 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-01-11 03:30:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1139. [2022-01-11 03:30:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4393673110720562) internal successors, (1638), 1138 states have internal predecessors, (1638), 0 states have call successors, (0), 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:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1638 transitions. [2022-01-11 03:30:05,710 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1638 transitions. Word has length 162 [2022-01-11 03:30:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,710 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1638 transitions. [2022-01-11 03:30:05,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1638 transitions. [2022-01-11 03:30:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-11 03:30:05,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,713 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 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, 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:05,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:05,714 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash 240154296, now seen corresponding path program 1 times [2022-01-11 03:30:05,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236801665] [2022-01-11 03:30:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-01-11 03:30:05,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:05,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236801665] [2022-01-11 03:30:05,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236801665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:05,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:05,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:05,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277340934] [2022-01-11 03:30:05,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:05,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:05,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:05,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:05,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:05,801 INFO L87 Difference]: Start difference. First operand 1139 states and 1638 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,919 INFO L93 Difference]: Finished difference Result 2344 states and 3358 transitions. [2022-01-11 03:30:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:05,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 198 [2022-01-11 03:30:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,923 INFO L225 Difference]: With dead ends: 2344 [2022-01-11 03:30:05,924 INFO L226 Difference]: Without dead ends: 1245 [2022-01-11 03:30:05,925 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:05,926 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:05,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2022-01-11 03:30:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1231. [2022-01-11 03:30:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1230 states have (on average 1.4227642276422765) internal successors, (1750), 1230 states have internal predecessors, (1750), 0 states have call successors, (0), 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:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1750 transitions. [2022-01-11 03:30:05,952 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1750 transitions. Word has length 198 [2022-01-11 03:30:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,953 INFO L470 AbstractCegarLoop]: Abstraction has 1231 states and 1750 transitions. [2022-01-11 03:30:05,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1750 transitions. [2022-01-11 03:30:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-01-11 03:30:05,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,956 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:05,957 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:05,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash -266539713, now seen corresponding path program 1 times [2022-01-11 03:30:05,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862589855] [2022-01-11 03:30:05,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-01-11 03:30:06,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:06,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862589855] [2022-01-11 03:30:06,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862589855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:06,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:06,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:06,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190218811] [2022-01-11 03:30:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:06,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:06,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:06,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:06,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:06,038 INFO L87 Difference]: Start difference. First operand 1231 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:06,152 INFO L93 Difference]: Finished difference Result 2534 states and 3600 transitions. [2022-01-11 03:30:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 219 [2022-01-11 03:30:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:06,157 INFO L225 Difference]: With dead ends: 2534 [2022-01-11 03:30:06,157 INFO L226 Difference]: Without dead ends: 1343 [2022-01-11 03:30:06,161 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:06,162 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:06,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-01-11 03:30:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1331. [2022-01-11 03:30:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1330 states have (on average 1.406015037593985) internal successors, (1870), 1330 states have internal predecessors, (1870), 0 states have call successors, (0), 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:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1870 transitions. [2022-01-11 03:30:06,192 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1870 transitions. Word has length 219 [2022-01-11 03:30:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:06,192 INFO L470 AbstractCegarLoop]: Abstraction has 1331 states and 1870 transitions. [2022-01-11 03:30:06,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1870 transitions. [2022-01-11 03:30:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-11 03:30:06,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:06,196 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:06,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:30:06,196 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash -673221243, now seen corresponding path program 1 times [2022-01-11 03:30:06,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:06,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100745180] [2022-01-11 03:30:06,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:06,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-11 03:30:06,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:06,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100745180] [2022-01-11 03:30:06,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100745180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:06,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:06,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:06,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142371891] [2022-01-11 03:30:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:06,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:06,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:06,319 INFO L87 Difference]: Start difference. First operand 1331 states and 1870 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:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:06,441 INFO L93 Difference]: Finished difference Result 2742 states and 3852 transitions. [2022-01-11 03:30:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:06,441 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 243 [2022-01-11 03:30:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:06,446 INFO L225 Difference]: With dead ends: 2742 [2022-01-11 03:30:06,446 INFO L226 Difference]: Without dead ends: 1451 [2022-01-11 03:30:06,448 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:06,448 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:06,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-01-11 03:30:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1443. [2022-01-11 03:30:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1442 states have (on average 1.3883495145631068) internal successors, (2002), 1442 states have internal predecessors, (2002), 0 states have call successors, (0), 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:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2002 transitions. [2022-01-11 03:30:06,479 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2002 transitions. Word has length 243 [2022-01-11 03:30:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:06,479 INFO L470 AbstractCegarLoop]: Abstraction has 1443 states and 2002 transitions. [2022-01-11 03:30:06,480 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:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2002 transitions. [2022-01-11 03:30:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-11 03:30:06,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:06,484 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:06,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:30:06,484 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1819761756, now seen corresponding path program 1 times [2022-01-11 03:30:06,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:06,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180613387] [2022-01-11 03:30:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:06,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-11 03:30:06,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:06,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180613387] [2022-01-11 03:30:06,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180613387] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:06,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:06,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:06,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864227268] [2022-01-11 03:30:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:06,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:06,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:06,572 INFO L87 Difference]: Start difference. First operand 1443 states and 2002 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:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:06,700 INFO L93 Difference]: Finished difference Result 2982 states and 4152 transitions. [2022-01-11 03:30:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:06,701 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 243 [2022-01-11 03:30:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:06,706 INFO L225 Difference]: With dead ends: 2982 [2022-01-11 03:30:06,706 INFO L226 Difference]: Without dead ends: 1579 [2022-01-11 03:30:06,708 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:06,709 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:06,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 263 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-01-11 03:30:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1567. [2022-01-11 03:30:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1566 states have (on average 1.3703703703703705) internal successors, (2146), 1566 states have internal predecessors, (2146), 0 states have call successors, (0), 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:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2146 transitions. [2022-01-11 03:30:06,744 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2146 transitions. Word has length 243 [2022-01-11 03:30:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:06,744 INFO L470 AbstractCegarLoop]: Abstraction has 1567 states and 2146 transitions. [2022-01-11 03:30:06,744 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:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2146 transitions. [2022-01-11 03:30:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-11 03:30:06,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:06,748 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:30:06,748 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash 663271861, now seen corresponding path program 1 times [2022-01-11 03:30:06,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:06,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170026097] [2022-01-11 03:30:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:06,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-11 03:30:06,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:06,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170026097] [2022-01-11 03:30:06,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170026097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:06,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:06,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:06,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518325599] [2022-01-11 03:30:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:06,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:06,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:06,851 INFO L87 Difference]: Start difference. First operand 1567 states and 2146 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:06,909 INFO L93 Difference]: Finished difference Result 4505 states and 6206 transitions. [2022-01-11 03:30:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:06,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 273 [2022-01-11 03:30:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:06,921 INFO L225 Difference]: With dead ends: 4505 [2022-01-11 03:30:06,921 INFO L226 Difference]: Without dead ends: 2978 [2022-01-11 03:30:06,924 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:06,925 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:06,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 484 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2022-01-11 03:30:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2022-01-11 03:30:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 1.3778151260504201) internal successors, (4099), 2975 states have internal predecessors, (4099), 0 states have call successors, (0), 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:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4099 transitions. [2022-01-11 03:30:06,993 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4099 transitions. Word has length 273 [2022-01-11 03:30:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:06,993 INFO L470 AbstractCegarLoop]: Abstraction has 2976 states and 4099 transitions. [2022-01-11 03:30:06,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4099 transitions. [2022-01-11 03:30:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-11 03:30:06,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:07,000 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:07,000 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash -483268652, now seen corresponding path program 1 times [2022-01-11 03:30:07,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669110026] [2022-01-11 03:30:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:07,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-01-11 03:30:07,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:07,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669110026] [2022-01-11 03:30:07,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669110026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:07,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:07,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:07,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403639580] [2022-01-11 03:30:07,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:07,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:07,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:07,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:07,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:07,100 INFO L87 Difference]: Start difference. First operand 2976 states and 4099 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:07,260 INFO L93 Difference]: Finished difference Result 6212 states and 8594 transitions. [2022-01-11 03:30:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:07,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 273 [2022-01-11 03:30:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:07,271 INFO L225 Difference]: With dead ends: 6212 [2022-01-11 03:30:07,271 INFO L226 Difference]: Without dead ends: 3276 [2022-01-11 03:30:07,276 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:07,277 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:07,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 263 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2022-01-11 03:30:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3260. [2022-01-11 03:30:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 3259 states have (on average 1.3571647744706965) internal successors, (4423), 3259 states have internal predecessors, (4423), 0 states have call successors, (0), 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:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 4423 transitions. [2022-01-11 03:30:07,381 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 4423 transitions. Word has length 273 [2022-01-11 03:30:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:07,381 INFO L470 AbstractCegarLoop]: Abstraction has 3260 states and 4423 transitions. [2022-01-11 03:30:07,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4423 transitions. [2022-01-11 03:30:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-01-11 03:30:07,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:07,390 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:30:07,391 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash -891406372, now seen corresponding path program 1 times [2022-01-11 03:30:07,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:07,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967315619] [2022-01-11 03:30:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:07,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-01-11 03:30:07,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967315619] [2022-01-11 03:30:07,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967315619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:07,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:07,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:07,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058027255] [2022-01-11 03:30:07,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:07,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:07,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:07,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:07,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:07,509 INFO L87 Difference]: Start difference. First operand 3260 states and 4423 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:07,655 INFO L93 Difference]: Finished difference Result 6628 states and 9010 transitions. [2022-01-11 03:30:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:07,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2022-01-11 03:30:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:07,666 INFO L225 Difference]: With dead ends: 6628 [2022-01-11 03:30:07,666 INFO L226 Difference]: Without dead ends: 3408 [2022-01-11 03:30:07,670 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:07,671 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:07,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2022-01-11 03:30:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3392. [2022-01-11 03:30:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3392 states, 3391 states have (on average 1.3491595399587142) internal successors, (4575), 3391 states have internal predecessors, (4575), 0 states have call successors, (0), 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:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4575 transitions. [2022-01-11 03:30:07,749 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4575 transitions. Word has length 297 [2022-01-11 03:30:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:07,749 INFO L470 AbstractCegarLoop]: Abstraction has 3392 states and 4575 transitions. [2022-01-11 03:30:07,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4575 transitions. [2022-01-11 03:30:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-01-11 03:30:07,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:07,757 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 03:30:07,757 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash -126484033, now seen corresponding path program 1 times [2022-01-11 03:30:07,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:07,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025877220] [2022-01-11 03:30:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:07,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-11 03:30:07,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:07,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025877220] [2022-01-11 03:30:07,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025877220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:07,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:07,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:07,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510252452] [2022-01-11 03:30:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:07,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:07,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:07,846 INFO L87 Difference]: Start difference. First operand 3392 states and 4575 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:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:08,028 INFO L93 Difference]: Finished difference Result 7144 states and 9774 transitions. [2022-01-11 03:30:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:08,029 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 308 [2022-01-11 03:30:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:08,041 INFO L225 Difference]: With dead ends: 7144 [2022-01-11 03:30:08,041 INFO L226 Difference]: Without dead ends: 3792 [2022-01-11 03:30:08,045 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:08,045 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 50 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:08,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 255 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2022-01-11 03:30:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3704. [2022-01-11 03:30:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 3703 states have (on average 1.3348636240885767) internal successors, (4943), 3703 states have internal predecessors, (4943), 0 states have call successors, (0), 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:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 4943 transitions. [2022-01-11 03:30:08,127 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 4943 transitions. Word has length 308 [2022-01-11 03:30:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:08,127 INFO L470 AbstractCegarLoop]: Abstraction has 3704 states and 4943 transitions. [2022-01-11 03:30:08,127 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:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 4943 transitions. [2022-01-11 03:30:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-01-11 03:30:08,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:08,135 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:08,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 03:30:08,135 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1226069730, now seen corresponding path program 1 times [2022-01-11 03:30:08,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:08,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272347278] [2022-01-11 03:30:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:08,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-11 03:30:08,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:08,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272347278] [2022-01-11 03:30:08,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272347278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:08,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:08,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:08,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327094732] [2022-01-11 03:30:08,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:08,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:08,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:08,235 INFO L87 Difference]: Start difference. First operand 3704 states and 4943 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:08,405 INFO L93 Difference]: Finished difference Result 7776 states and 10318 transitions. [2022-01-11 03:30:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:08,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 322 [2022-01-11 03:30:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:08,420 INFO L225 Difference]: With dead ends: 7776 [2022-01-11 03:30:08,420 INFO L226 Difference]: Without dead ends: 4112 [2022-01-11 03:30:08,425 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:08,425 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:08,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 140 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2022-01-11 03:30:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 3824. [2022-01-11 03:30:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3823 states have (on average 1.3306303949777663) internal successors, (5087), 3823 states have internal predecessors, (5087), 0 states have call successors, (0), 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:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5087 transitions. [2022-01-11 03:30:08,546 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5087 transitions. Word has length 322 [2022-01-11 03:30:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:08,546 INFO L470 AbstractCegarLoop]: Abstraction has 3824 states and 5087 transitions. [2022-01-11 03:30:08,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5087 transitions. [2022-01-11 03:30:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-01-11 03:30:08,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:08,558 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:08,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 03:30:08,558 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash -480804331, now seen corresponding path program 1 times [2022-01-11 03:30:08,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:08,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136161107] [2022-01-11 03:30:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:08,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2022-01-11 03:30:08,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:08,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136161107] [2022-01-11 03:30:08,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136161107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:08,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:08,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:08,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569818183] [2022-01-11 03:30:08,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:08,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:08,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:08,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:08,670 INFO L87 Difference]: Start difference. First operand 3824 states and 5087 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:08,770 INFO L93 Difference]: Finished difference Result 10888 states and 14573 transitions. [2022-01-11 03:30:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2022-01-11 03:30:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:08,788 INFO L225 Difference]: With dead ends: 10888 [2022-01-11 03:30:08,788 INFO L226 Difference]: Without dead ends: 7104 [2022-01-11 03:30:08,794 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:08,795 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 84 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 471 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:08,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 471 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:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2022-01-11 03:30:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 7102. [2022-01-11 03:30:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7102 states, 7101 states have (on average 1.3391071680045064) internal successors, (9509), 7101 states have internal predecessors, (9509), 0 states have call successors, (0), 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:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 9509 transitions. [2022-01-11 03:30:08,996 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 9509 transitions. Word has length 323 [2022-01-11 03:30:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:08,997 INFO L470 AbstractCegarLoop]: Abstraction has 7102 states and 9509 transitions. [2022-01-11 03:30:08,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 9509 transitions. [2022-01-11 03:30:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-01-11 03:30:09,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:09,009 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:09,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 03:30:09,009 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:09,010 INFO L85 PathProgramCache]: Analyzing trace with hash 807326787, now seen corresponding path program 1 times [2022-01-11 03:30:09,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:09,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352202490] [2022-01-11 03:30:09,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:09,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-01-11 03:30:09,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352202490] [2022-01-11 03:30:09,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352202490] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:09,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:09,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:09,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052660639] [2022-01-11 03:30:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:09,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:09,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:09,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:09,106 INFO L87 Difference]: Start difference. First operand 7102 states and 9509 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:09,311 INFO L93 Difference]: Finished difference Result 14172 states and 18962 transitions. [2022-01-11 03:30:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 324 [2022-01-11 03:30:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:09,325 INFO L225 Difference]: With dead ends: 14172 [2022-01-11 03:30:09,325 INFO L226 Difference]: Without dead ends: 7110 [2022-01-11 03:30:09,334 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:09,335 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:09,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 258 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7110 states. [2022-01-11 03:30:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7110 to 7078. [2022-01-11 03:30:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7078 states, 7077 states have (on average 1.30408365126466) internal successors, (9229), 7077 states have internal predecessors, (9229), 0 states have call successors, (0), 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:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7078 states to 7078 states and 9229 transitions. [2022-01-11 03:30:09,529 INFO L78 Accepts]: Start accepts. Automaton has 7078 states and 9229 transitions. Word has length 324 [2022-01-11 03:30:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:09,529 INFO L470 AbstractCegarLoop]: Abstraction has 7078 states and 9229 transitions. [2022-01-11 03:30:09,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7078 states and 9229 transitions. [2022-01-11 03:30:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-01-11 03:30:09,541 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:09,541 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 03:30:09,542 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:09,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash -760521568, now seen corresponding path program 1 times [2022-01-11 03:30:09,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:09,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406402882] [2022-01-11 03:30:09,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:09,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-11 03:30:09,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406402882] [2022-01-11 03:30:09,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406402882] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308024337] [2022-01-11 03:30:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:09,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:09,687 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:09,713 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:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:09,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:09,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-11 03:30:10,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-11 03:30:10,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308024337] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:10,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:10,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:10,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16557286] [2022-01-11 03:30:10,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:10,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:10,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:10,908 INFO L87 Difference]: Start difference. First operand 7078 states and 9229 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:11,417 INFO L93 Difference]: Finished difference Result 14166 states and 18473 transitions. [2022-01-11 03:30:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:30:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 347 [2022-01-11 03:30:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:11,435 INFO L225 Difference]: With dead ends: 14166 [2022-01-11 03:30:11,436 INFO L226 Difference]: Without dead ends: 10726 [2022-01-11 03:30:11,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 694 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:11,443 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 242 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:11,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 929 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:30:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2022-01-11 03:30:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 8182. [2022-01-11 03:30:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8182 states, 8181 states have (on average 1.310964429776311) internal successors, (10725), 8181 states have internal predecessors, (10725), 0 states have call successors, (0), 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:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8182 states to 8182 states and 10725 transitions. [2022-01-11 03:30:11,605 INFO L78 Accepts]: Start accepts. Automaton has 8182 states and 10725 transitions. Word has length 347 [2022-01-11 03:30:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:11,605 INFO L470 AbstractCegarLoop]: Abstraction has 8182 states and 10725 transitions. [2022-01-11 03:30:11,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 8182 states and 10725 transitions. [2022-01-11 03:30:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-01-11 03:30:11,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:11,618 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:11,651 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:11,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-01-11 03:30:11,832 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1626398900, now seen corresponding path program 2 times [2022-01-11 03:30:11,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:11,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703015128] [2022-01-11 03:30:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:11,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-11 03:30:11,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:11,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703015128] [2022-01-11 03:30:11,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703015128] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400919506] [2022-01-11 03:30:11,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 03:30:11,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:11,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:11,983 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:11,984 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:12,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 03:30:12,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 03:30:12,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 03:30:12,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2022-01-11 03:30:12,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:12,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400919506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:12,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:12,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:12,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427065437] [2022-01-11 03:30:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:12,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:12,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:12,681 INFO L87 Difference]: Start difference. First operand 8182 states and 10725 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:12,890 INFO L93 Difference]: Finished difference Result 16600 states and 21738 transitions. [2022-01-11 03:30:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:12,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:12,906 INFO L225 Difference]: With dead ends: 16600 [2022-01-11 03:30:12,906 INFO L226 Difference]: Without dead ends: 8458 [2022-01-11 03:30:12,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:12,918 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:12,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 238 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2022-01-11 03:30:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 7606. [2022-01-11 03:30:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7606 states, 7605 states have (on average 1.2587771203155818) internal successors, (9573), 7605 states have internal predecessors, (9573), 0 states have call successors, (0), 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:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 9573 transitions. [2022-01-11 03:30:13,120 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 9573 transitions. Word has length 360 [2022-01-11 03:30:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:13,121 INFO L470 AbstractCegarLoop]: Abstraction has 7606 states and 9573 transitions. [2022-01-11 03:30:13,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 9573 transitions. [2022-01-11 03:30:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-01-11 03:30:13,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:13,132 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:13,159 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:13,351 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,SelfDestructingSolverStorable21 [2022-01-11 03:30:13,351 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 592688313, now seen corresponding path program 1 times [2022-01-11 03:30:13,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:13,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264211520] [2022-01-11 03:30:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:13,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-11 03:30:13,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:13,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264211520] [2022-01-11 03:30:13,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264211520] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:13,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056755775] [2022-01-11 03:30:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:13,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:13,504 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:13,531 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:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:13,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:13,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-11 03:30:14,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-11 03:30:14,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056755775] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:14,637 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:14,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-11 03:30:14,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249095723] [2022-01-11 03:30:14,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:14,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:14,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:14,639 INFO L87 Difference]: Start difference. First operand 7606 states and 9573 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:14,949 INFO L93 Difference]: Finished difference Result 17303 states and 21679 transitions. [2022-01-11 03:30:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:30:14,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 374 [2022-01-11 03:30:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:14,965 INFO L225 Difference]: With dead ends: 17303 [2022-01-11 03:30:14,966 INFO L226 Difference]: Without dead ends: 9729 [2022-01-11 03:30:14,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 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:14,976 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 438 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:14,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 427 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2022-01-11 03:30:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 7998. [2022-01-11 03:30:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7998 states, 7997 states have (on average 1.2553457546579967) internal successors, (10039), 7997 states have internal predecessors, (10039), 0 states have call successors, (0), 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:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 10039 transitions. [2022-01-11 03:30:15,170 INFO L78 Accepts]: Start accepts. Automaton has 7998 states and 10039 transitions. Word has length 374 [2022-01-11 03:30:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:15,171 INFO L470 AbstractCegarLoop]: Abstraction has 7998 states and 10039 transitions. [2022-01-11 03:30:15,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7998 states and 10039 transitions. [2022-01-11 03:30:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-01-11 03:30:15,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:15,181 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:15,209 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:15,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:15,410 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1447116694, now seen corresponding path program 1 times [2022-01-11 03:30:15,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979796656] [2022-01-11 03:30:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:15,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-01-11 03:30:15,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:15,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979796656] [2022-01-11 03:30:15,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979796656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:15,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:15,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:15,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481548322] [2022-01-11 03:30:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:15,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:15,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:15,531 INFO L87 Difference]: Start difference. First operand 7998 states and 10039 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:15,734 INFO L93 Difference]: Finished difference Result 15094 states and 18568 transitions. [2022-01-11 03:30:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:15,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2022-01-11 03:30:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:15,742 INFO L225 Difference]: With dead ends: 15094 [2022-01-11 03:30:15,742 INFO L226 Difference]: Without dead ends: 3682 [2022-01-11 03:30:15,750 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:15,751 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:15,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2022-01-11 03:30:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 3490. [2022-01-11 03:30:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.2427629693321869) internal successors, (4336), 3489 states have internal predecessors, (4336), 0 states have call successors, (0), 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:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4336 transitions. [2022-01-11 03:30:15,803 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4336 transitions. Word has length 413 [2022-01-11 03:30:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:15,803 INFO L470 AbstractCegarLoop]: Abstraction has 3490 states and 4336 transitions. [2022-01-11 03:30:15,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4336 transitions. [2022-01-11 03:30:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-01-11 03:30:15,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:15,809 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 03:30:15,809 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1699095301, now seen corresponding path program 1 times [2022-01-11 03:30:15,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:15,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307705285] [2022-01-11 03:30:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:15,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2022-01-11 03:30:15,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:15,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307705285] [2022-01-11 03:30:15,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307705285] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:15,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773163162] [2022-01-11 03:30:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:15,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:15,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:15,927 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:15,957 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:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1976 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:16,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2022-01-11 03:30:18,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:18,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773163162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:18,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:18,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:18,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879669142] [2022-01-11 03:30:18,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:18,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:18,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:18,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:18,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:18,163 INFO L87 Difference]: Start difference. First operand 3490 states and 4336 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:18,219 INFO L93 Difference]: Finished difference Result 3907 states and 4819 transitions. [2022-01-11 03:30:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:18,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 497 [2022-01-11 03:30:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:18,225 INFO L225 Difference]: With dead ends: 3907 [2022-01-11 03:30:18,225 INFO L226 Difference]: Without dead ends: 3830 [2022-01-11 03:30:18,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 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:18,226 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 61 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 445 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:18,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 445 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:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2022-01-11 03:30:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 3415. [2022-01-11 03:30:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3414 states have (on average 1.2428236672524897) internal successors, (4243), 3414 states have internal predecessors, (4243), 0 states have call successors, (0), 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:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4243 transitions. [2022-01-11 03:30:18,280 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4243 transitions. Word has length 497 [2022-01-11 03:30:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:18,281 INFO L470 AbstractCegarLoop]: Abstraction has 3415 states and 4243 transitions. [2022-01-11 03:30:18,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4243 transitions. [2022-01-11 03:30:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2022-01-11 03:30:18,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:18,287 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,315 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:18,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:18,501 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash 92766666, now seen corresponding path program 1 times [2022-01-11 03:30:18,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:18,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236092432] [2022-01-11 03:30:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:18,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-01-11 03:30:18,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236092432] [2022-01-11 03:30:18,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236092432] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727870449] [2022-01-11 03:30:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:18,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:18,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:18,628 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:18,629 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:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:18,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 2363 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-11 03:30:18,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-01-11 03:30:19,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:30:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-01-11 03:30:20,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727870449] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:30:20,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:30:20,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-11 03:30:20,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571167676] [2022-01-11 03:30:20,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:30:20,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:30:20,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:30:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:30:20,469 INFO L87 Difference]: Start difference. First operand 3415 states and 4243 transitions. Second operand has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 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:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:20,742 INFO L93 Difference]: Finished difference Result 4269 states and 5301 transitions. [2022-01-11 03:30:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:30:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 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 609 [2022-01-11 03:30:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:20,743 INFO L225 Difference]: With dead ends: 4269 [2022-01-11 03:30:20,743 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:20,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1217 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 03:30:20,746 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 113 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:20,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 589 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:20,748 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:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:20,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2022-01-11 03:30:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:20,749 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:20,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 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:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:20,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:20,751 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:20,779 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:20,979 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,SelfDestructingSolverStorable25 [2022-01-11 03:30:20,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:30:25,722 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:30:25,722 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:30:25,722 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 111) no Hoare annotation was computed. [2022-01-11 03:30:25,722 INFO L858 garLoopResultBuilder]: For program point L108-2(lines 105 111) no Hoare annotation was computed. [2022-01-11 03:30:25,722 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 110) no Hoare annotation was computed. [2022-01-11 03:30:25,722 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 117) no Hoare annotation was computed. [2022-01-11 03:30:25,722 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 116) no Hoare annotation was computed. [2022-01-11 03:30:25,723 INFO L858 garLoopResultBuilder]: For program point L119-1(lines 96 586) no Hoare annotation was computed. [2022-01-11 03:30:25,723 INFO L861 garLoopResultBuilder]: At program point L575(lines 118 576) the Hoare annotation is: true [2022-01-11 03:30:25,723 INFO L858 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2022-01-11 03:30:25,723 INFO L858 garLoopResultBuilder]: For program point L580(lines 580 582) no Hoare annotation was computed. [2022-01-11 03:30:25,723 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 555) no Hoare annotation was computed. [2022-01-11 03:30:25,723 INFO L858 garLoopResultBuilder]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2022-01-11 03:30:25,723 INFO L854 garLoopResultBuilder]: At program point L123(lines 122 555) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-11 03:30:25,723 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 554) no Hoare annotation was computed. [2022-01-11 03:30:25,723 INFO L861 garLoopResultBuilder]: At program point L585(lines 22 587) the Hoare annotation is: true [2022-01-11 03:30:25,724 INFO L854 garLoopResultBuilder]: At program point L227(lines 125 554) the Hoare annotation is: (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) [2022-01-11 03:30:25,725 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 553) no Hoare annotation was computed. [2022-01-11 03:30:25,725 INFO L861 garLoopResultBuilder]: At program point L596(lines 588 598) the Hoare annotation is: true [2022-01-11 03:30:25,725 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-11 03:30:25,725 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 552) no Hoare annotation was computed. [2022-01-11 03:30:25,725 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:30:25,725 INFO L858 garLoopResultBuilder]: For program point L232-2(lines 232 234) no Hoare annotation was computed. [2022-01-11 03:30:25,725 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 551) no Hoare annotation was computed. [2022-01-11 03:30:25,726 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:30:25,727 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 240) no Hoare annotation was computed. [2022-01-11 03:30:25,727 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 550) no Hoare annotation was computed. [2022-01-11 03:30:25,727 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 263) no Hoare annotation was computed. [2022-01-11 03:30:25,727 INFO L854 garLoopResultBuilder]: At program point L141(lines 137 550) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-11 03:30:25,727 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 549) no Hoare annotation was computed. [2022-01-11 03:30:25,727 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-01-11 03:30:25,727 INFO L858 garLoopResultBuilder]: For program point L247-2(lines 222 520) no Hoare annotation was computed. [2022-01-11 03:30:25,728 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 283) no Hoare annotation was computed. [2022-01-11 03:30:25,728 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 548) no Hoare annotation was computed. [2022-01-11 03:30:25,728 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 261) no Hoare annotation was computed. [2022-01-11 03:30:25,728 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 272) no Hoare annotation was computed. [2022-01-11 03:30:25,728 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 222 520) no Hoare annotation was computed. [2022-01-11 03:30:25,728 INFO L854 garLoopResultBuilder]: At program point L147(lines 143 548) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-11 03:30:25,728 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 547) no Hoare annotation was computed. [2022-01-11 03:30:25,729 INFO L854 garLoopResultBuilder]: At program point L521(lines 119 574) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (let ((.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse5 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse6 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (.cse12 (= 4496 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse2 (= 4448 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse14 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse11 (not .cse0)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|)) (.cse3 (= 4528 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse9 (= 4512 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse17 (= 4480 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse16 (= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse18 (= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 3)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse5 .cse1 .cse6) (and .cse7 (= 4416 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse0) (and .cse8 .cse9 .cse10) (and .cse7 .cse0 (= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse4 .cse5 .cse8 .cse11 .cse10) (and .cse0 .cse1 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse6) (and .cse7 .cse0 .cse12) (and .cse1 .cse15) (and .cse7 .cse0 .cse2) (and .cse16 .cse0 .cse10) (and .cse13 .cse8 .cse14 .cse11 .cse10) (and .cse7 .cse17 .cse0) (and .cse0 .cse1 .cse9) (and (= 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse10) (and .cse7 .cse0 .cse3) (and .cse18 .cse0 .cse1) (and .cse8 .cse3 .cse10) (and .cse7 .cse0 .cse9) (and .cse17 .cse0 .cse1) (and .cse7 .cse16 .cse0 .cse1) (and .cse7 .cse18 .cse0) (and .cse0 .cse15 .cse10)))) [2022-01-11 03:30:25,729 INFO L858 garLoopResultBuilder]: For program point L292(lines 292 294) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L300(lines 300 306) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 546) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 571) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L556(lines 556 572) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L303-2(lines 222 520) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 305) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L854 garLoopResultBuilder]: At program point L153(lines 149 546) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)))) [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 545) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 563) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 331) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 544) no Hoare annotation was computed. [2022-01-11 03:30:25,730 INFO L858 garLoopResultBuilder]: For program point L560(lines 560 562) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L558-2(lines 557 571) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L321-2(lines 321 331) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 327) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L854 garLoopResultBuilder]: At program point L159(lines 155 544) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 543) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L325-2(lines 323 331) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 341) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 542) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L339-2(lines 222 520) no Hoare annotation was computed. [2022-01-11 03:30:25,731 INFO L854 garLoopResultBuilder]: At program point L165(lines 161 542) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-11 03:30:25,731 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 541) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 350) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 357) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 540) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L854 garLoopResultBuilder]: At program point L356(lines 96 586) the Hoare annotation is: false [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 360) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L854 garLoopResultBuilder]: At program point L171(lines 167 540) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 539) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 584) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 369) no Hoare annotation was computed. [2022-01-11 03:30:25,732 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 538) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L854 garLoopResultBuilder]: At program point L183(lines 173 538) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 537) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L370-2(lines 370 374) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 384) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 536) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 535) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 534) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 534) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 533) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L391(lines 391 393) no Hoare annotation was computed. [2022-01-11 03:30:25,733 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 532) no Hoare annotation was computed. [2022-01-11 03:30:25,734 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 400) no Hoare annotation was computed. [2022-01-11 03:30:25,734 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 532) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-11 03:30:25,734 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 531) no Hoare annotation was computed. [2022-01-11 03:30:25,734 INFO L858 garLoopResultBuilder]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2022-01-11 03:30:25,734 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 408) no Hoare annotation was computed. [2022-01-11 03:30:25,734 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 530) no Hoare annotation was computed. [2022-01-11 03:30:25,734 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 530) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-11 03:30:25,734 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 529) no Hoare annotation was computed. [2022-01-11 03:30:25,734 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 528) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L422(lines 422 426) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 528) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 527) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L422-2(lines 222 520) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 441) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 526) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L431(lines 431 434) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 460) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 526) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 12292) .cse0) (and .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse0 (not .cse1) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 525) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 456) no Hoare annotation was computed. [2022-01-11 03:30:25,735 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 446 460) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 468) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 524) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L854 garLoopResultBuilder]: At program point L216(lines 215 524) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse1 .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) (not .cse0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse1 .cse2))) [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 523) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L469-2(lines 469 473) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 491) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L861 garLoopResultBuilder]: At program point L219(lines 218 523) the Hoare annotation is: true [2022-01-11 03:30:25,736 INFO L861 garLoopResultBuilder]: At program point L221(lines 220 523) the Hoare annotation is: true [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L485(lines 485 488) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L479-2(lines 479 491) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L496-1(lines 496 498) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 504) no Hoare annotation was computed. [2022-01-11 03:30:25,736 INFO L858 garLoopResultBuilder]: For program point L502-2(lines 502 504) no Hoare annotation was computed. [2022-01-11 03:30:25,737 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-01-11 03:30:25,737 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 508 510) no Hoare annotation was computed. [2022-01-11 03:30:25,737 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 515) no Hoare annotation was computed. [2022-01-11 03:30:25,739 INFO L732 BasicCegarLoop]: Path program histogram: [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:25,740 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:25,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:25 BasicIcfg [2022-01-11 03:30:25,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:25,778 INFO L158 Benchmark]: Toolchain (without parser) took 23903.88ms. Allocated memory was 175.1MB in the beginning and 570.4MB in the end (delta: 395.3MB). Free memory was 124.7MB in the beginning and 189.2MB in the end (delta: -64.5MB). Peak memory consumption was 365.0MB. Max. memory is 8.0GB. [2022-01-11 03:30:25,779 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:25,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.00ms. Allocated memory is still 175.1MB. Free memory was 124.5MB in the beginning and 146.3MB in the end (delta: -21.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:25,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.78ms. Allocated memory is still 175.1MB. Free memory was 146.3MB in the beginning and 143.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:25,783 INFO L158 Benchmark]: Boogie Preprocessor took 38.76ms. Allocated memory is still 175.1MB. Free memory was 143.2MB in the beginning and 141.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:25,784 INFO L158 Benchmark]: RCFGBuilder took 641.13ms. Allocated memory is still 175.1MB. Free memory was 141.1MB in the beginning and 115.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-11 03:30:25,784 INFO L158 Benchmark]: IcfgTransformer took 211.83ms. Allocated memory is still 175.1MB. Free memory was 115.4MB in the beginning and 100.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-11 03:30:25,784 INFO L158 Benchmark]: TraceAbstraction took 22642.33ms. Allocated memory was 175.1MB in the beginning and 570.4MB in the end (delta: 395.3MB). Free memory was 99.6MB in the beginning and 189.2MB in the end (delta: -89.5MB). Peak memory consumption was 340.3MB. Max. memory is 8.0GB. [2022-01-11 03:30:25,785 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.11ms. Allocated memory is still 175.1MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.00ms. Allocated memory is still 175.1MB. Free memory was 124.5MB in the beginning and 146.3MB in the end (delta: -21.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.78ms. Allocated memory is still 175.1MB. Free memory was 146.3MB in the beginning and 143.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.76ms. Allocated memory is still 175.1MB. Free memory was 143.2MB in the beginning and 141.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 641.13ms. Allocated memory is still 175.1MB. Free memory was 141.1MB in the beginning and 115.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * IcfgTransformer took 211.83ms. Allocated memory is still 175.1MB. Free memory was 115.4MB in the beginning and 100.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 22642.33ms. Allocated memory was 175.1MB in the beginning and 570.4MB in the end (delta: 395.3MB). Free memory was 99.6MB in the beginning and 189.2MB in the end (delta: -89.5MB). Peak memory consumption was 340.3MB. 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: 584]: 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, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 26, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2181 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2181 mSDsluCounter, 8472 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3362 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2992 IncrementalHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 5110 mSDtfsCounter, 2992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3602 GetRequests, 3557 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8182occurred in iteration=21, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 6334 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 256 NumberOfFragments, 745 HoareAnnotationTreeSize, 22 FomulaSimplifications, 14888 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 22 FomulaSimplificationsInter, 11217 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 8522 NumberOfCodeBlocks, 8522 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 9818 ConstructedInterpolants, 0 QuantifiedInterpolants, 15535 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8925 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 42923/43035 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: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32)) || ((blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && ~bvule32(s__state, 4352bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && ~bvule32(4560bv32, s__state) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4384bv32, s__state)) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) && ~bvule32(blastFlag, 4bv32))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4384bv32, s__state)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && s__state == 4400bv32) || blastFlag == 0bv32) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && s__state == 4400bv32)) || ((0bv32 == s__hit && 4512bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4512bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32))) || (~bvule32(blastFlag, 2bv32) && s__state == 4384bv32)) || ((s__state == 4448bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4480bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4528bv32 == s__state)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && s__state == 4448bv32) && 0bv32 == s__hit)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && s__state == 4496bv32)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4512bv32 == s__state)) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4432bv32 == s__state)) || (~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 3bv32))) || ((s__state == 4416bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32))) || ((0bv32 == s__hit && s__state == 4496bv32) && ~bvule32(blastFlag, 4bv32))) || ((0bv32 == s__hit && 4480bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && ~bvule32(s__state, 3bv32))) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4464bv32 == s__state)) || ((0bv32 == s__hit && 4528bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4464bv32 == s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4528bv32 == s__state) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(4560bv32, s__state)) && ~bvult64(s__state, 12292bv32)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state)) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:30:25,839 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...