/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_NONE.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:42:07,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:42:07,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:42:07,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:42:07,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:42:07,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:42:07,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:42:07,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:42:07,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:42:07,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:42:07,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:42:07,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:42:07,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:42:07,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:42:07,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:42:07,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:42:07,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:42:07,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:42:07,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:42:07,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:42:07,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:42:07,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:42:07,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:42:07,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:42:07,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:42:07,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:42:07,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:42:07,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:42:07,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:42:07,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:42:07,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:42:07,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:42:07,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:42:07,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:42:07,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:42:07,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:42:07,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:42:07,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:42:07,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:42:07,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:42:07,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:42:07,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:42:07,495 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:42:07,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:42:07,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:42:07,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:42:07,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:42:07,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:42:07,496 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:42:07,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:42:07,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:42:07,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:42:07,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:42:07,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:42:07,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:42:07,497 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:42:07,497 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:42:07,498 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:42:07,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:42:07,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:42:07,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:42:07,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:42:07,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:42:07,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:07,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:42:07,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:42:07,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:42:07,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:42:07,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:42:07,502 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:42:07,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:42:07,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:42:07,503 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:42:07,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:42:07,504 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:42:07,504 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-10 21:42:07,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:42:07,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:42:07,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:42:07,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:42:07,776 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:42:07,777 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-10 21:42:07,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2155bf3/8a70f209a9ba4c00bd1957147977b3fc/FLAGfabd19424 [2022-01-10 21:42:08,261 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:42:08,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-3.c [2022-01-10 21:42:08,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2155bf3/8a70f209a9ba4c00bd1957147977b3fc/FLAGfabd19424 [2022-01-10 21:42:08,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2155bf3/8a70f209a9ba4c00bd1957147977b3fc [2022-01-10 21:42:08,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:42:08,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:42:08,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:08,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:42:08,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:42:08,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e00fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08, skipping insertion in model container [2022-01-10 21:42:08,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:42:08,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:42:08,549 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-10 21:42:08,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:08,560 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:42:08,600 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-10 21:42:08,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:42:08,613 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:42:08,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08 WrapperNode [2022-01-10 21:42:08,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:42:08,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:08,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:42:08,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:42:08,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,658 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 481 [2022-01-10 21:42:08,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:42:08,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:42:08,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:42:08,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:42:08,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:42:08,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:42:08,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:42:08,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:42:08,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (1/1) ... [2022-01-10 21:42:08,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:42:08,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:08,740 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-10 21:42:08,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 21:42:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:42:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:42:08,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:42:08,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:42:08,903 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:42:08,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:42:08,916 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:42:09,344 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 21:42:09,344 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 21:42:09,344 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:42:09,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:42:09,350 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:42:09,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:09 BoogieIcfgContainer [2022-01-10 21:42:09,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:42:09,353 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:42:09,353 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:42:09,354 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:42:09,357 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:09" (1/1) ... [2022-01-10 21:42:09,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:09 BasicIcfg [2022-01-10 21:42:09,512 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:42:09,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:42:09,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:42:09,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:42:09,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:42:08" (1/4) ... [2022-01-10 21:42:09,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61539d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:09, skipping insertion in model container [2022-01-10 21:42:09,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:42:08" (2/4) ... [2022-01-10 21:42:09,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61539d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:42:09, skipping insertion in model container [2022-01-10 21:42:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:42:09" (3/4) ... [2022-01-10 21:42:09,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61539d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:09, skipping insertion in model container [2022-01-10 21:42:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:42:09" (4/4) ... [2022-01-10 21:42:09,523 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.cTransformedIcfg [2022-01-10 21:42:09,527 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:42:09,527 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:42:09,592 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:42:09,599 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-10 21:42:09,600 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:42:09,618 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-10 21:42:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 21:42:09,625 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:09,626 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-10 21:42:09,627 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1955201792, now seen corresponding path program 1 times [2022-01-10 21:42:09,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:09,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613078823] [2022-01-10 21:42:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:09,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:09,901 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-10 21:42:09,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:09,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613078823] [2022-01-10 21:42:09,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613078823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:09,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:09,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:09,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808911764] [2022-01-10 21:42:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:09,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:09,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:09,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:09,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:09,940 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-10 21:42:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:10,051 INFO L93 Difference]: Finished difference Result 366 states and 620 transitions. [2022-01-10 21:42:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:10,053 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-10 21:42:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:10,067 INFO L225 Difference]: With dead ends: 366 [2022-01-10 21:42:10,067 INFO L226 Difference]: Without dead ends: 213 [2022-01-10 21:42:10,070 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-10 21:42:10,075 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-10 21:42:10,076 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-10 21:42:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-01-10 21:42:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-01-10 21:42:10,134 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-10 21:42:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-01-10 21:42:10,139 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-01-10 21:42:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:10,140 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-01-10 21:42:10,140 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-10 21:42:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-01-10 21:42:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:42:10,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:10,143 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-10 21:42:10,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:42:10,144 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash -206431364, now seen corresponding path program 1 times [2022-01-10 21:42:10,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:10,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140607391] [2022-01-10 21:42:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:10,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:10,270 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-10 21:42:10,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:10,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140607391] [2022-01-10 21:42:10,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140607391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:10,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:10,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:10,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798087815] [2022-01-10 21:42:10,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:10,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:10,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:10,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:10,276 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-10 21:42:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:10,456 INFO L93 Difference]: Finished difference Result 345 states and 519 transitions. [2022-01-10 21:42:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:10,457 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-10 21:42:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:10,459 INFO L225 Difference]: With dead ends: 345 [2022-01-10 21:42:10,459 INFO L226 Difference]: Without dead ends: 240 [2022-01-10 21:42:10,459 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-10 21:42:10,461 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.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:10,461 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.2s Time] [2022-01-10 21:42:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-10 21:42:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 230. [2022-01-10 21:42:10,473 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-10 21:42:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2022-01-10 21:42:10,474 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 38 [2022-01-10 21:42:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:10,475 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2022-01-10 21:42:10,475 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-10 21:42:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2022-01-10 21:42:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 21:42:10,477 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:10,477 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-10 21:42:10,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:42:10,477 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1673793400, now seen corresponding path program 1 times [2022-01-10 21:42:10,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:10,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121895728] [2022-01-10 21:42:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:10,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:10,571 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-10 21:42:10,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:10,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121895728] [2022-01-10 21:42:10,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121895728] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:10,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:10,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:10,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494426132] [2022-01-10 21:42:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:10,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:10,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:10,575 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-10 21:42:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:10,720 INFO L93 Difference]: Finished difference Result 503 states and 750 transitions. [2022-01-10 21:42:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:10,720 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-10 21:42:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:10,722 INFO L225 Difference]: With dead ends: 503 [2022-01-10 21:42:10,722 INFO L226 Difference]: Without dead ends: 280 [2022-01-10 21:42:10,723 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-10 21:42:10,724 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-10 21:42:10,725 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-10 21:42:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-01-10 21:42:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2022-01-10 21:42:10,735 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-10 21:42:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 389 transitions. [2022-01-10 21:42:10,736 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 389 transitions. Word has length 55 [2022-01-10 21:42:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:10,736 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 389 transitions. [2022-01-10 21:42:10,737 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-10 21:42:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 389 transitions. [2022-01-10 21:42:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 21:42:10,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:10,739 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-10 21:42:10,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:42:10,739 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:10,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1376409415, now seen corresponding path program 1 times [2022-01-10 21:42:10,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:10,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901262690] [2022-01-10 21:42:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:10,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:10,812 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-10 21:42:10,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:10,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901262690] [2022-01-10 21:42:10,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901262690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:10,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:10,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:10,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910539971] [2022-01-10 21:42:10,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:10,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:10,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:10,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:10,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:10,815 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-10 21:42:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:11,012 INFO L93 Difference]: Finished difference Result 633 states and 943 transitions. [2022-01-10 21:42:11,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:11,013 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-10 21:42:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:11,015 INFO L225 Difference]: With dead ends: 633 [2022-01-10 21:42:11,015 INFO L226 Difference]: Without dead ends: 368 [2022-01-10 21:42:11,017 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-10 21:42:11,027 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-10 21:42:11,029 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-10 21:42:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-01-10 21:42:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 350. [2022-01-10 21:42:11,039 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-10 21:42:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 487 transitions. [2022-01-10 21:42:11,041 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 487 transitions. Word has length 55 [2022-01-10 21:42:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:11,041 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 487 transitions. [2022-01-10 21:42:11,041 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-10 21:42:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 487 transitions. [2022-01-10 21:42:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 21:42:11,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:11,057 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-10 21:42:11,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:42:11,057 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 728612485, now seen corresponding path program 1 times [2022-01-10 21:42:11,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:11,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137927453] [2022-01-10 21:42:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:11,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:11,170 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-10 21:42:11,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:11,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137927453] [2022-01-10 21:42:11,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137927453] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:11,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:11,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:11,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668896027] [2022-01-10 21:42:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:11,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:11,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:11,173 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-10 21:42:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:11,354 INFO L93 Difference]: Finished difference Result 832 states and 1184 transitions. [2022-01-10 21:42:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:11,354 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-10 21:42:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:11,358 INFO L225 Difference]: With dead ends: 832 [2022-01-10 21:42:11,358 INFO L226 Difference]: Without dead ends: 487 [2022-01-10 21:42:11,359 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-10 21:42:11,363 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.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:11,363 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.2s Time] [2022-01-10 21:42:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-01-10 21:42:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 461. [2022-01-10 21:42:11,376 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-10 21:42:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 658 transitions. [2022-01-10 21:42:11,378 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 658 transitions. Word has length 81 [2022-01-10 21:42:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:11,378 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 658 transitions. [2022-01-10 21:42:11,378 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-10 21:42:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 658 transitions. [2022-01-10 21:42:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 21:42:11,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:11,381 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-10 21:42:11,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:42:11,381 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1395994320, now seen corresponding path program 1 times [2022-01-10 21:42:11,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:11,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181701153] [2022-01-10 21:42:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:11,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:11,453 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-10 21:42:11,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:11,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181701153] [2022-01-10 21:42:11,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181701153] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:11,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:11,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:11,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155663178] [2022-01-10 21:42:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:11,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:11,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:11,455 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-10 21:42:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:11,570 INFO L93 Difference]: Finished difference Result 930 states and 1345 transitions. [2022-01-10 21:42:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:11,571 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-10 21:42:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:11,573 INFO L225 Difference]: With dead ends: 930 [2022-01-10 21:42:11,573 INFO L226 Difference]: Without dead ends: 509 [2022-01-10 21:42:11,574 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-10 21:42:11,574 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-10 21:42:11,575 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-10 21:42:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-01-10 21:42:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 503. [2022-01-10 21:42:11,592 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-10 21:42:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 710 transitions. [2022-01-10 21:42:11,593 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 710 transitions. Word has length 85 [2022-01-10 21:42:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:11,593 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 710 transitions. [2022-01-10 21:42:11,594 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-10 21:42:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 710 transitions. [2022-01-10 21:42:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 21:42:11,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:11,595 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-10 21:42:11,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:42:11,595 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:11,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash -415148971, now seen corresponding path program 1 times [2022-01-10 21:42:11,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:11,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474458869] [2022-01-10 21:42:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:11,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:11,655 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-10 21:42:11,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:11,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474458869] [2022-01-10 21:42:11,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474458869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:11,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:11,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:11,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117375204] [2022-01-10 21:42:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:11,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:11,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:11,657 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-10 21:42:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:11,686 INFO L93 Difference]: Finished difference Result 985 states and 1403 transitions. [2022-01-10 21:42:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:11,686 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-10 21:42:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:11,690 INFO L225 Difference]: With dead ends: 985 [2022-01-10 21:42:11,690 INFO L226 Difference]: Without dead ends: 743 [2022-01-10 21:42:11,690 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-10 21:42:11,691 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-10 21:42:11,691 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-10 21:42:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-01-10 21:42:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2022-01-10 21:42:11,707 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-10 21:42:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1053 transitions. [2022-01-10 21:42:11,709 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1053 transitions. Word has length 105 [2022-01-10 21:42:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:11,709 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1053 transitions. [2022-01-10 21:42:11,710 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-10 21:42:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1053 transitions. [2022-01-10 21:42:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 21:42:11,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:11,711 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-10 21:42:11,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:42:11,712 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1817883518, now seen corresponding path program 1 times [2022-01-10 21:42:11,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:11,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12828652] [2022-01-10 21:42:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:11,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:11,764 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-10 21:42:11,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12828652] [2022-01-10 21:42:11,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12828652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:11,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:11,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:11,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020285731] [2022-01-10 21:42:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:11,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:11,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:11,766 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-10 21:42:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:11,796 INFO L93 Difference]: Finished difference Result 985 states and 1400 transitions. [2022-01-10 21:42:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:11,797 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-10 21:42:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:11,800 INFO L225 Difference]: With dead ends: 985 [2022-01-10 21:42:11,800 INFO L226 Difference]: Without dead ends: 983 [2022-01-10 21:42:11,801 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-10 21:42:11,801 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-10 21:42:11,802 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-10 21:42:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-01-10 21:42:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2022-01-10 21:42:11,821 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-10 21:42:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1398 transitions. [2022-01-10 21:42:11,824 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1398 transitions. Word has length 107 [2022-01-10 21:42:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:11,824 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1398 transitions. [2022-01-10 21:42:11,824 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-10 21:42:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1398 transitions. [2022-01-10 21:42:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 21:42:11,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:11,827 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-10 21:42:11,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:42:11,827 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1100801225, now seen corresponding path program 1 times [2022-01-10 21:42:11,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:11,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486956220] [2022-01-10 21:42:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:11,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:11,884 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-10 21:42:11,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:11,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486956220] [2022-01-10 21:42:11,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486956220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:11,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:11,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:11,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591067340] [2022-01-10 21:42:11,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:11,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:11,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:11,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:11,886 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-10 21:42:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:12,042 INFO L93 Difference]: Finished difference Result 2130 states and 3088 transitions. [2022-01-10 21:42:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:12,043 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-10 21:42:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:12,047 INFO L225 Difference]: With dead ends: 2130 [2022-01-10 21:42:12,047 INFO L226 Difference]: Without dead ends: 1179 [2022-01-10 21:42:12,049 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-10 21:42:12,051 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-10 21:42:12,051 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-10 21:42:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-01-10 21:42:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1139. [2022-01-10 21:42:12,074 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-10 21:42:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1638 transitions. [2022-01-10 21:42:12,077 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1638 transitions. Word has length 162 [2022-01-10 21:42:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:12,077 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1638 transitions. [2022-01-10 21:42:12,077 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-10 21:42:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1638 transitions. [2022-01-10 21:42:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 21:42:12,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:12,080 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-10 21:42:12,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:42:12,081 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 240154296, now seen corresponding path program 1 times [2022-01-10 21:42:12,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684296798] [2022-01-10 21:42:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:12,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:12,178 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-10 21:42:12,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:12,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684296798] [2022-01-10 21:42:12,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684296798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:12,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:12,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:12,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169692491] [2022-01-10 21:42:12,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:12,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:12,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:12,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:12,180 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-10 21:42:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:12,287 INFO L93 Difference]: Finished difference Result 2344 states and 3358 transitions. [2022-01-10 21:42:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:12,288 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-10 21:42:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:12,302 INFO L225 Difference]: With dead ends: 2344 [2022-01-10 21:42:12,302 INFO L226 Difference]: Without dead ends: 1245 [2022-01-10 21:42:12,303 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-10 21:42:12,304 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-10 21:42:12,305 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-10 21:42:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2022-01-10 21:42:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1231. [2022-01-10 21:42:12,327 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-10 21:42:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1750 transitions. [2022-01-10 21:42:12,330 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1750 transitions. Word has length 198 [2022-01-10 21:42:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:12,330 INFO L470 AbstractCegarLoop]: Abstraction has 1231 states and 1750 transitions. [2022-01-10 21:42:12,331 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-10 21:42:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1750 transitions. [2022-01-10 21:42:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-01-10 21:42:12,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:12,334 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-10 21:42:12,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:42:12,334 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -266539713, now seen corresponding path program 1 times [2022-01-10 21:42:12,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:12,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511591350] [2022-01-10 21:42:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:12,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:12,412 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-10 21:42:12,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:12,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511591350] [2022-01-10 21:42:12,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511591350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:12,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:12,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:12,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400010684] [2022-01-10 21:42:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:12,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:12,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:12,415 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-10 21:42:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:12,535 INFO L93 Difference]: Finished difference Result 2534 states and 3600 transitions. [2022-01-10 21:42:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:12,535 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-10 21:42:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:12,540 INFO L225 Difference]: With dead ends: 2534 [2022-01-10 21:42:12,541 INFO L226 Difference]: Without dead ends: 1343 [2022-01-10 21:42:12,543 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-10 21:42:12,543 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-10 21:42:12,544 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-10 21:42:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-01-10 21:42:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1331. [2022-01-10 21:42:12,569 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-10 21:42:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1870 transitions. [2022-01-10 21:42:12,573 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1870 transitions. Word has length 219 [2022-01-10 21:42:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:12,573 INFO L470 AbstractCegarLoop]: Abstraction has 1331 states and 1870 transitions. [2022-01-10 21:42:12,573 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-10 21:42:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1870 transitions. [2022-01-10 21:42:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-10 21:42:12,577 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:12,577 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-10 21:42:12,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:42:12,577 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash -673221243, now seen corresponding path program 1 times [2022-01-10 21:42:12,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:12,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893187189] [2022-01-10 21:42:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:12,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:12,651 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-10 21:42:12,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:12,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893187189] [2022-01-10 21:42:12,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893187189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:12,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:12,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:12,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960514688] [2022-01-10 21:42:12,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:12,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:12,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:12,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:12,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:12,653 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-10 21:42:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:12,773 INFO L93 Difference]: Finished difference Result 2742 states and 3852 transitions. [2022-01-10 21:42:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:12,774 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-10 21:42:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:12,779 INFO L225 Difference]: With dead ends: 2742 [2022-01-10 21:42:12,779 INFO L226 Difference]: Without dead ends: 1451 [2022-01-10 21:42:12,781 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-10 21:42:12,782 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-10 21:42:12,782 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-10 21:42:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-01-10 21:42:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1443. [2022-01-10 21:42:12,811 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-10 21:42:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2002 transitions. [2022-01-10 21:42:12,815 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2002 transitions. Word has length 243 [2022-01-10 21:42:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:12,815 INFO L470 AbstractCegarLoop]: Abstraction has 1443 states and 2002 transitions. [2022-01-10 21:42:12,816 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-10 21:42:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2002 transitions. [2022-01-10 21:42:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-10 21:42:12,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:12,820 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-10 21:42:12,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:42:12,820 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1819761756, now seen corresponding path program 1 times [2022-01-10 21:42:12,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:12,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805203863] [2022-01-10 21:42:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:12,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:12,941 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-10 21:42:12,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:12,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805203863] [2022-01-10 21:42:12,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805203863] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:12,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:12,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:12,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201172640] [2022-01-10 21:42:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:12,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:12,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:12,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:12,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:12,943 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-10 21:42:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:13,056 INFO L93 Difference]: Finished difference Result 2982 states and 4152 transitions. [2022-01-10 21:42:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:13,057 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-10 21:42:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:13,062 INFO L225 Difference]: With dead ends: 2982 [2022-01-10 21:42:13,062 INFO L226 Difference]: Without dead ends: 1579 [2022-01-10 21:42:13,064 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-10 21:42:13,065 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-10 21:42:13,066 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-10 21:42:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-01-10 21:42:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1567. [2022-01-10 21:42:13,099 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-10 21:42:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2146 transitions. [2022-01-10 21:42:13,103 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2146 transitions. Word has length 243 [2022-01-10 21:42:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:13,103 INFO L470 AbstractCegarLoop]: Abstraction has 1567 states and 2146 transitions. [2022-01-10 21:42:13,104 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-10 21:42:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2146 transitions. [2022-01-10 21:42:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-10 21:42:13,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:13,108 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-10 21:42:13,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:42:13,109 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash 663271861, now seen corresponding path program 1 times [2022-01-10 21:42:13,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:13,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104350585] [2022-01-10 21:42:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:13,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:13,217 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-10 21:42:13,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:13,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104350585] [2022-01-10 21:42:13,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104350585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:13,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:13,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:13,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961342825] [2022-01-10 21:42:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:13,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:13,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:13,220 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-10 21:42:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:13,266 INFO L93 Difference]: Finished difference Result 4505 states and 6206 transitions. [2022-01-10 21:42:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:13,267 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-10 21:42:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:13,278 INFO L225 Difference]: With dead ends: 4505 [2022-01-10 21:42:13,278 INFO L226 Difference]: Without dead ends: 2978 [2022-01-10 21:42:13,281 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-10 21:42:13,282 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-10 21:42:13,282 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-10 21:42:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2022-01-10 21:42:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2022-01-10 21:42:13,349 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-10 21:42:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4099 transitions. [2022-01-10 21:42:13,357 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4099 transitions. Word has length 273 [2022-01-10 21:42:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:13,357 INFO L470 AbstractCegarLoop]: Abstraction has 2976 states and 4099 transitions. [2022-01-10 21:42:13,358 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-10 21:42:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4099 transitions. [2022-01-10 21:42:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-10 21:42:13,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:13,364 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-10 21:42:13,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:42:13,365 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash -483268652, now seen corresponding path program 1 times [2022-01-10 21:42:13,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:13,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611614392] [2022-01-10 21:42:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:13,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:13,509 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-10 21:42:13,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:13,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611614392] [2022-01-10 21:42:13,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611614392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:13,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:13,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:13,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914645176] [2022-01-10 21:42:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:13,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:13,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:13,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:13,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:13,511 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-10 21:42:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:13,670 INFO L93 Difference]: Finished difference Result 6212 states and 8594 transitions. [2022-01-10 21:42:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:13,671 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-10 21:42:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:13,685 INFO L225 Difference]: With dead ends: 6212 [2022-01-10 21:42:13,685 INFO L226 Difference]: Without dead ends: 3276 [2022-01-10 21:42:13,691 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-10 21:42:13,693 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-10 21:42:13,693 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-10 21:42:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2022-01-10 21:42:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3260. [2022-01-10 21:42:13,779 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-10 21:42:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 4423 transitions. [2022-01-10 21:42:13,789 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 4423 transitions. Word has length 273 [2022-01-10 21:42:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:13,790 INFO L470 AbstractCegarLoop]: Abstraction has 3260 states and 4423 transitions. [2022-01-10 21:42:13,790 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-10 21:42:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4423 transitions. [2022-01-10 21:42:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-01-10 21:42:13,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:13,798 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-10 21:42:13,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:42:13,798 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -891406372, now seen corresponding path program 1 times [2022-01-10 21:42:13,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762183086] [2022-01-10 21:42:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:13,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:13,889 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-10 21:42:13,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:13,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762183086] [2022-01-10 21:42:13,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762183086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:13,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:13,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:13,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414349589] [2022-01-10 21:42:13,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:13,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:13,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:13,891 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-10 21:42:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:14,048 INFO L93 Difference]: Finished difference Result 6628 states and 9010 transitions. [2022-01-10 21:42:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:14,048 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-10 21:42:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:14,061 INFO L225 Difference]: With dead ends: 6628 [2022-01-10 21:42:14,061 INFO L226 Difference]: Without dead ends: 3408 [2022-01-10 21:42:14,066 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-10 21:42:14,067 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-10 21:42:14,067 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-10 21:42:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2022-01-10 21:42:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3392. [2022-01-10 21:42:14,142 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-10 21:42:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4575 transitions. [2022-01-10 21:42:14,151 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4575 transitions. Word has length 297 [2022-01-10 21:42:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:14,152 INFO L470 AbstractCegarLoop]: Abstraction has 3392 states and 4575 transitions. [2022-01-10 21:42:14,152 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-10 21:42:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4575 transitions. [2022-01-10 21:42:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-01-10 21:42:14,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:14,159 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-10 21:42:14,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:42:14,160 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:14,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash -126484033, now seen corresponding path program 1 times [2022-01-10 21:42:14,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:14,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738457346] [2022-01-10 21:42:14,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:14,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:14,259 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-10 21:42:14,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:14,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738457346] [2022-01-10 21:42:14,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738457346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:14,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:14,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:14,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807404327] [2022-01-10 21:42:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:14,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:14,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:14,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:14,261 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-10 21:42:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:14,453 INFO L93 Difference]: Finished difference Result 7144 states and 9774 transitions. [2022-01-10 21:42:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:14,454 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-10 21:42:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:14,467 INFO L225 Difference]: With dead ends: 7144 [2022-01-10 21:42:14,468 INFO L226 Difference]: Without dead ends: 3792 [2022-01-10 21:42:14,473 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-10 21:42:14,474 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-10 21:42:14,474 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-10 21:42:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2022-01-10 21:42:14,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3704. [2022-01-10 21:42:14,557 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-10 21:42:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 4943 transitions. [2022-01-10 21:42:14,566 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 4943 transitions. Word has length 308 [2022-01-10 21:42:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:14,566 INFO L470 AbstractCegarLoop]: Abstraction has 3704 states and 4943 transitions. [2022-01-10 21:42:14,566 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-10 21:42:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 4943 transitions. [2022-01-10 21:42:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-01-10 21:42:14,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:14,575 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-10 21:42:14,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 21:42:14,575 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1226069730, now seen corresponding path program 1 times [2022-01-10 21:42:14,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:14,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313462423] [2022-01-10 21:42:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:14,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:14,668 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-10 21:42:14,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313462423] [2022-01-10 21:42:14,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313462423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:14,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:14,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:14,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455278157] [2022-01-10 21:42:14,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:14,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:14,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:14,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:14,670 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-10 21:42:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:14,863 INFO L93 Difference]: Finished difference Result 7776 states and 10318 transitions. [2022-01-10 21:42:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:14,864 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-10 21:42:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:14,878 INFO L225 Difference]: With dead ends: 7776 [2022-01-10 21:42:14,878 INFO L226 Difference]: Without dead ends: 4112 [2022-01-10 21:42:14,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:14,884 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-10 21:42:14,885 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-10 21:42:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2022-01-10 21:42:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 3824. [2022-01-10 21:42:14,984 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-10 21:42:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5087 transitions. [2022-01-10 21:42:14,993 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5087 transitions. Word has length 322 [2022-01-10 21:42:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:14,994 INFO L470 AbstractCegarLoop]: Abstraction has 3824 states and 5087 transitions. [2022-01-10 21:42:14,994 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-10 21:42:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5087 transitions. [2022-01-10 21:42:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-01-10 21:42:15,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:15,003 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-10 21:42:15,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 21:42:15,004 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash -480804331, now seen corresponding path program 1 times [2022-01-10 21:42:15,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:15,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036218928] [2022-01-10 21:42:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:15,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:15,105 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-10 21:42:15,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036218928] [2022-01-10 21:42:15,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036218928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:15,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:15,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:15,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010369796] [2022-01-10 21:42:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:15,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:15,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:15,107 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-10 21:42:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:15,199 INFO L93 Difference]: Finished difference Result 10888 states and 14573 transitions. [2022-01-10 21:42:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:15,206 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-10 21:42:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:15,227 INFO L225 Difference]: With dead ends: 10888 [2022-01-10 21:42:15,227 INFO L226 Difference]: Without dead ends: 7104 [2022-01-10 21:42:15,234 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-10 21:42:15,235 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-10 21:42:15,236 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-10 21:42:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2022-01-10 21:42:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 7102. [2022-01-10 21:42:15,394 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-10 21:42:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 9509 transitions. [2022-01-10 21:42:15,478 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 9509 transitions. Word has length 323 [2022-01-10 21:42:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:15,478 INFO L470 AbstractCegarLoop]: Abstraction has 7102 states and 9509 transitions. [2022-01-10 21:42:15,479 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-10 21:42:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 9509 transitions. [2022-01-10 21:42:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-01-10 21:42:15,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:15,491 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-10 21:42:15,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 21:42:15,491 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 807326787, now seen corresponding path program 1 times [2022-01-10 21:42:15,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:15,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323937698] [2022-01-10 21:42:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:15,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:15,576 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-10 21:42:15,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:15,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323937698] [2022-01-10 21:42:15,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323937698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:15,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:15,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:15,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363746097] [2022-01-10 21:42:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:15,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:15,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:15,578 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-10 21:42:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:15,800 INFO L93 Difference]: Finished difference Result 14172 states and 18962 transitions. [2022-01-10 21:42:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:15,801 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-10 21:42:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:15,816 INFO L225 Difference]: With dead ends: 14172 [2022-01-10 21:42:15,816 INFO L226 Difference]: Without dead ends: 7110 [2022-01-10 21:42:15,826 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-10 21:42:15,827 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-10 21:42:15,828 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-10 21:42:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7110 states. [2022-01-10 21:42:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7110 to 7078. [2022-01-10 21:42:16,063 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-10 21:42:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7078 states to 7078 states and 9229 transitions. [2022-01-10 21:42:16,077 INFO L78 Accepts]: Start accepts. Automaton has 7078 states and 9229 transitions. Word has length 324 [2022-01-10 21:42:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:16,078 INFO L470 AbstractCegarLoop]: Abstraction has 7078 states and 9229 transitions. [2022-01-10 21:42:16,078 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-10 21:42:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 7078 states and 9229 transitions. [2022-01-10 21:42:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-01-10 21:42:16,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:16,092 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-10 21:42:16,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 21:42:16,092 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash -760521568, now seen corresponding path program 1 times [2022-01-10 21:42:16,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:16,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727535847] [2022-01-10 21:42:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:16,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:16,247 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-10 21:42:16,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:16,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727535847] [2022-01-10 21:42:16,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727535847] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:16,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22186172] [2022-01-10 21:42:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:16,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:16,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:16,250 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-10 21:42:16,252 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-10 21:42:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:16,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:16,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:17,231 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-10 21:42:17,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:17,734 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-10 21:42:17,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22186172] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:17,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:17,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 21:42:17,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631455732] [2022-01-10 21:42:17,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:17,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:17,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:17,738 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-10 21:42:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:18,334 INFO L93 Difference]: Finished difference Result 14166 states and 18473 transitions. [2022-01-10 21:42:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:42:18,335 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-10 21:42:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:18,353 INFO L225 Difference]: With dead ends: 14166 [2022-01-10 21:42:18,354 INFO L226 Difference]: Without dead ends: 10726 [2022-01-10 21:42:18,360 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-10 21:42:18,361 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-10 21:42:18,361 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-10 21:42:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2022-01-10 21:42:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 8182. [2022-01-10 21:42:18,532 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-10 21:42:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8182 states to 8182 states and 10725 transitions. [2022-01-10 21:42:18,547 INFO L78 Accepts]: Start accepts. Automaton has 8182 states and 10725 transitions. Word has length 347 [2022-01-10 21:42:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:18,547 INFO L470 AbstractCegarLoop]: Abstraction has 8182 states and 10725 transitions. [2022-01-10 21:42:18,548 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-10 21:42:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 8182 states and 10725 transitions. [2022-01-10 21:42:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-01-10 21:42:18,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:18,561 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-10 21:42:18,594 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-10 21:42:18,775 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-10 21:42:18,776 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1626398900, now seen corresponding path program 2 times [2022-01-10 21:42:18,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:18,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769636752] [2022-01-10 21:42:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:18,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:18,904 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-10 21:42:18,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769636752] [2022-01-10 21:42:18,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769636752] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249223337] [2022-01-10 21:42:18,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 21:42:18,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:18,906 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-10 21:42:18,908 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-10 21:42:19,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 21:42:19,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 21:42:19,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 21:42:19,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:19,630 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-10 21:42:19,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:42:19,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249223337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:19,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:42:19,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 21:42:19,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68726287] [2022-01-10 21:42:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:19,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:19,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:19,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:19,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:19,632 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-10 21:42:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:19,871 INFO L93 Difference]: Finished difference Result 16600 states and 21738 transitions. [2022-01-10 21:42:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:19,872 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-10 21:42:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:19,888 INFO L225 Difference]: With dead ends: 16600 [2022-01-10 21:42:19,888 INFO L226 Difference]: Without dead ends: 8458 [2022-01-10 21:42:19,901 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-10 21:42:19,902 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-10 21:42:19,902 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-10 21:42:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2022-01-10 21:42:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 7606. [2022-01-10 21:42:20,063 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-10 21:42:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 9573 transitions. [2022-01-10 21:42:20,077 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 9573 transitions. Word has length 360 [2022-01-10 21:42:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:20,078 INFO L470 AbstractCegarLoop]: Abstraction has 7606 states and 9573 transitions. [2022-01-10 21:42:20,078 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-10 21:42:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 9573 transitions. [2022-01-10 21:42:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-01-10 21:42:20,089 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:20,089 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-10 21:42:20,118 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-10 21:42:20,304 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-10 21:42:20,304 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 592688313, now seen corresponding path program 1 times [2022-01-10 21:42:20,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:20,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112781956] [2022-01-10 21:42:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:20,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:20,453 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-10 21:42:20,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:20,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112781956] [2022-01-10 21:42:20,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112781956] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:20,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878821367] [2022-01-10 21:42:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:20,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:20,455 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-10 21:42:20,457 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-10 21:42:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:20,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:20,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:21,282 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-10 21:42:21,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:21,776 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-10 21:42:21,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878821367] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:21,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:21,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 21:42:21,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978364447] [2022-01-10 21:42:21,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:21,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:21,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:21,778 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-10 21:42:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:22,141 INFO L93 Difference]: Finished difference Result 17303 states and 21679 transitions. [2022-01-10 21:42:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:22,141 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-10 21:42:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:22,160 INFO L225 Difference]: With dead ends: 17303 [2022-01-10 21:42:22,160 INFO L226 Difference]: Without dead ends: 9729 [2022-01-10 21:42:22,172 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-10 21:42:22,173 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 438 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-10 21:42:22,173 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-10 21:42:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2022-01-10 21:42:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 7998. [2022-01-10 21:42:22,389 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-10 21:42:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 10039 transitions. [2022-01-10 21:42:22,405 INFO L78 Accepts]: Start accepts. Automaton has 7998 states and 10039 transitions. Word has length 374 [2022-01-10 21:42:22,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:22,406 INFO L470 AbstractCegarLoop]: Abstraction has 7998 states and 10039 transitions. [2022-01-10 21:42:22,406 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-10 21:42:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 7998 states and 10039 transitions. [2022-01-10 21:42:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-01-10 21:42:22,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:22,421 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-10 21:42:22,448 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-10 21:42:22,643 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-10 21:42:22,644 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1447116694, now seen corresponding path program 1 times [2022-01-10 21:42:22,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:22,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398771937] [2022-01-10 21:42:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:22,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:22,774 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-10 21:42:22,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:22,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398771937] [2022-01-10 21:42:22,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398771937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:22,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:22,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:42:22,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126483709] [2022-01-10 21:42:22,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:22,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:22,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:42:22,777 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-10 21:42:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:22,992 INFO L93 Difference]: Finished difference Result 15094 states and 18568 transitions. [2022-01-10 21:42:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:22,993 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-10 21:42:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:23,000 INFO L225 Difference]: With dead ends: 15094 [2022-01-10 21:42:23,000 INFO L226 Difference]: Without dead ends: 3682 [2022-01-10 21:42:23,010 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-10 21:42:23,010 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-10 21:42:23,011 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-10 21:42:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2022-01-10 21:42:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 3490. [2022-01-10 21:42:23,080 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-10 21:42:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4336 transitions. [2022-01-10 21:42:23,086 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4336 transitions. Word has length 413 [2022-01-10 21:42:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:23,087 INFO L470 AbstractCegarLoop]: Abstraction has 3490 states and 4336 transitions. [2022-01-10 21:42:23,087 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-10 21:42:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4336 transitions. [2022-01-10 21:42:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-01-10 21:42:23,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:23,095 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-10 21:42:23,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 21:42:23,095 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1699095301, now seen corresponding path program 1 times [2022-01-10 21:42:23,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:23,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105494794] [2022-01-10 21:42:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,233 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-10 21:42:23,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:23,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105494794] [2022-01-10 21:42:23,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105494794] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:23,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799774850] [2022-01-10 21:42:23,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:23,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:23,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:23,235 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-10 21:42:23,237 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-10 21:42:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:23,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 1976 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:23,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:25,244 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-10 21:42:25,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:42:25,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799774850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:25,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:42:25,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 21:42:25,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100436324] [2022-01-10 21:42:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:25,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:42:25,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:25,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:42:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:25,246 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-10 21:42:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:25,301 INFO L93 Difference]: Finished difference Result 3907 states and 4819 transitions. [2022-01-10 21:42:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:42:25,302 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-10 21:42:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:25,308 INFO L225 Difference]: With dead ends: 3907 [2022-01-10 21:42:25,309 INFO L226 Difference]: Without dead ends: 3830 [2022-01-10 21:42:25,310 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-10 21:42:25,311 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-10 21:42:25,311 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-10 21:42:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2022-01-10 21:42:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 3415. [2022-01-10 21:42:25,369 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-10 21:42:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4243 transitions. [2022-01-10 21:42:25,374 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4243 transitions. Word has length 497 [2022-01-10 21:42:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:25,375 INFO L470 AbstractCegarLoop]: Abstraction has 3415 states and 4243 transitions. [2022-01-10 21:42:25,375 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-10 21:42:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4243 transitions. [2022-01-10 21:42:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2022-01-10 21:42:25,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:25,383 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-10 21:42:25,411 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-10 21:42:25,601 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-10 21:42:25,601 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:42:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 92766666, now seen corresponding path program 1 times [2022-01-10 21:42:25,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:25,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061076409] [2022-01-10 21:42:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:25,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:25,722 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-10 21:42:25,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:25,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061076409] [2022-01-10 21:42:25,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061076409] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:42:25,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336744025] [2022-01-10 21:42:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:25,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:42:25,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:42:25,724 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-10 21:42:25,725 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-10 21:42:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:26,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 2363 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 21:42:26,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:42:26,817 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-10 21:42:26,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 21:42:27,562 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-10 21:42:27,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336744025] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 21:42:27,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 21:42:27,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 21:42:27,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463508662] [2022-01-10 21:42:27,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 21:42:27,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:42:27,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:42:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:42:27,564 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-10 21:42:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:27,826 INFO L93 Difference]: Finished difference Result 4269 states and 5301 transitions. [2022-01-10 21:42:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:27,827 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-10 21:42:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:27,827 INFO L225 Difference]: With dead ends: 4269 [2022-01-10 21:42:27,827 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:42:27,829 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-10 21:42:27,830 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-10 21:42:27,830 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-10 21:42:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:42:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:42:27,830 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-10 21:42:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:42:27,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2022-01-10 21:42:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:27,831 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:42:27,831 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-10 21:42:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:42:27,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:42:27,833 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 21:42:27,863 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-10 21:42:28,047 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-10 21:42:28,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:42:32,800 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 111) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L858 garLoopResultBuilder]: For program point L108-2(lines 105 111) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 110) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 117) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 116) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L858 garLoopResultBuilder]: For program point L119-1(lines 96 586) no Hoare annotation was computed. [2022-01-10 21:42:32,801 INFO L861 garLoopResultBuilder]: At program point L575(lines 118 576) the Hoare annotation is: true [2022-01-10 21:42:32,802 INFO L858 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2022-01-10 21:42:32,802 INFO L858 garLoopResultBuilder]: For program point L580(lines 580 582) no Hoare annotation was computed. [2022-01-10 21:42:32,802 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 555) no Hoare annotation was computed. [2022-01-10 21:42:32,802 INFO L858 garLoopResultBuilder]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2022-01-10 21:42:32,802 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-10 21:42:32,802 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 554) no Hoare annotation was computed. [2022-01-10 21:42:32,802 INFO L861 garLoopResultBuilder]: At program point L585(lines 22 587) the Hoare annotation is: true [2022-01-10 21:42:32,803 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-10 21:42:32,803 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 553) no Hoare annotation was computed. [2022-01-10 21:42:32,804 INFO L861 garLoopResultBuilder]: At program point L596(lines 588 598) the Hoare annotation is: true [2022-01-10 21:42:32,804 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 21:42:32,804 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 552) no Hoare annotation was computed. [2022-01-10 21:42:32,804 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:42:32,804 INFO L858 garLoopResultBuilder]: For program point L232-2(lines 232 234) no Hoare annotation was computed. [2022-01-10 21:42:32,804 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 551) no Hoare annotation was computed. [2022-01-10 21:42:32,804 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:42:32,806 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 240) no Hoare annotation was computed. [2022-01-10 21:42:32,806 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 550) no Hoare annotation was computed. [2022-01-10 21:42:32,806 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 263) no Hoare annotation was computed. [2022-01-10 21:42:32,806 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-10 21:42:32,806 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 549) no Hoare annotation was computed. [2022-01-10 21:42:32,806 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-01-10 21:42:32,806 INFO L858 garLoopResultBuilder]: For program point L247-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 21:42:32,807 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 283) no Hoare annotation was computed. [2022-01-10 21:42:32,807 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 548) no Hoare annotation was computed. [2022-01-10 21:42:32,808 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 261) no Hoare annotation was computed. [2022-01-10 21:42:32,808 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 272) no Hoare annotation was computed. [2022-01-10 21:42:32,808 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 21:42:32,808 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-10 21:42:32,808 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 547) no Hoare annotation was computed. [2022-01-10 21:42:32,809 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-10 21:42:32,810 INFO L858 garLoopResultBuilder]: For program point L292(lines 292 294) no Hoare annotation was computed. [2022-01-10 21:42:32,810 INFO L858 garLoopResultBuilder]: For program point L300(lines 300 306) no Hoare annotation was computed. [2022-01-10 21:42:32,810 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 546) no Hoare annotation was computed. [2022-01-10 21:42:32,810 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 571) no Hoare annotation was computed. [2022-01-10 21:42:32,810 INFO L858 garLoopResultBuilder]: For program point L556(lines 556 572) no Hoare annotation was computed. [2022-01-10 21:42:32,810 INFO L858 garLoopResultBuilder]: For program point L303-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 305) no Hoare annotation was computed. [2022-01-10 21:42:32,811 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-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 545) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 563) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 331) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 544) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L560(lines 560 562) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L558-2(lines 557 571) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2022-01-10 21:42:32,811 INFO L858 garLoopResultBuilder]: For program point L321-2(lines 321 331) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 327) no Hoare annotation was computed. [2022-01-10 21:42:32,812 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-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 543) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L325-2(lines 323 331) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 341) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 542) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L339-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 21:42:32,812 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-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 541) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 350) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 357) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 540) no Hoare annotation was computed. [2022-01-10 21:42:32,812 INFO L854 garLoopResultBuilder]: At program point L356(lines 96 586) the Hoare annotation is: false [2022-01-10 21:42:32,812 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 360) no Hoare annotation was computed. [2022-01-10 21:42:32,813 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-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 539) no Hoare annotation was computed. [2022-01-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 584) no Hoare annotation was computed. [2022-01-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 369) no Hoare annotation was computed. [2022-01-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 538) no Hoare annotation was computed. [2022-01-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-01-10 21:42:32,813 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-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 537) no Hoare annotation was computed. [2022-01-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point L370-2(lines 370 374) no Hoare annotation was computed. [2022-01-10 21:42:32,813 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 384) no Hoare annotation was computed. [2022-01-10 21:42:32,814 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 536) no Hoare annotation was computed. [2022-01-10 21:42:32,814 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 535) no Hoare annotation was computed. [2022-01-10 21:42:32,814 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 534) no Hoare annotation was computed. [2022-01-10 21:42:32,814 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-10 21:42:32,814 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 533) no Hoare annotation was computed. [2022-01-10 21:42:32,814 INFO L858 garLoopResultBuilder]: For program point L391(lines 391 393) no Hoare annotation was computed. [2022-01-10 21:42:32,814 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 532) no Hoare annotation was computed. [2022-01-10 21:42:32,814 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 400) no Hoare annotation was computed. [2022-01-10 21:42:32,815 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-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 531) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 408) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 530) no Hoare annotation was computed. [2022-01-10 21:42:32,815 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-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 529) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 528) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L422(lines 422 426) no Hoare annotation was computed. [2022-01-10 21:42:32,815 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-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 527) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L422-2(lines 222 520) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 441) no Hoare annotation was computed. [2022-01-10 21:42:32,815 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 526) no Hoare annotation was computed. [2022-01-10 21:42:32,816 INFO L858 garLoopResultBuilder]: For program point L431(lines 431 434) no Hoare annotation was computed. [2022-01-10 21:42:32,816 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 460) no Hoare annotation was computed. [2022-01-10 21:42:32,817 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-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 525) no Hoare annotation was computed. [2022-01-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 456) no Hoare annotation was computed. [2022-01-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 446 460) no Hoare annotation was computed. [2022-01-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 468) no Hoare annotation was computed. [2022-01-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 524) no Hoare annotation was computed. [2022-01-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2022-01-10 21:42:32,817 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-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 523) no Hoare annotation was computed. [2022-01-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L469-2(lines 469 473) no Hoare annotation was computed. [2022-01-10 21:42:32,817 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 491) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L861 garLoopResultBuilder]: At program point L219(lines 218 523) the Hoare annotation is: true [2022-01-10 21:42:32,818 INFO L861 garLoopResultBuilder]: At program point L221(lines 220 523) the Hoare annotation is: true [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L485(lines 485 488) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L479-2(lines 479 491) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L496-1(lines 496 498) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 504) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L502-2(lines 502 504) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 508 510) no Hoare annotation was computed. [2022-01-10 21:42:32,818 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 515) no Hoare annotation was computed. [2022-01-10 21:42:32,821 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-10 21:42:32,822 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:42:32,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:32 BasicIcfg [2022-01-10 21:42:32,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:42:32,880 INFO L158 Benchmark]: Toolchain (without parser) took 24578.80ms. Allocated memory was 190.8MB in the beginning and 634.4MB in the end (delta: 443.5MB). Free memory was 132.5MB in the beginning and 406.6MB in the end (delta: -274.2MB). Peak memory consumption was 390.4MB. Max. memory is 8.0GB. [2022-01-10 21:42:32,880 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 190.8MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:42:32,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.83ms. Allocated memory is still 190.8MB. Free memory was 132.2MB in the beginning and 155.3MB in the end (delta: -23.0MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2022-01-10 21:42:32,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.66ms. Allocated memory is still 190.8MB. Free memory was 155.3MB in the beginning and 152.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:32,880 INFO L158 Benchmark]: Boogie Preprocessor took 29.18ms. Allocated memory is still 190.8MB. Free memory was 152.7MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:32,881 INFO L158 Benchmark]: RCFGBuilder took 663.55ms. Allocated memory is still 190.8MB. Free memory was 150.3MB in the beginning and 125.3MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:32,881 INFO L158 Benchmark]: IcfgTransformer took 158.75ms. Allocated memory is still 190.8MB. Free memory was 125.3MB in the beginning and 158.5MB in the end (delta: -33.1MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:32,881 INFO L158 Benchmark]: TraceAbstraction took 23366.18ms. Allocated memory was 190.8MB in the beginning and 634.4MB in the end (delta: 443.5MB). Free memory was 158.0MB in the beginning and 406.6MB in the end (delta: -248.6MB). Peak memory consumption was 415.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:32,882 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.14ms. Allocated memory is still 190.8MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.83ms. Allocated memory is still 190.8MB. Free memory was 132.2MB in the beginning and 155.3MB in the end (delta: -23.0MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.66ms. Allocated memory is still 190.8MB. Free memory was 155.3MB in the beginning and 152.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.18ms. Allocated memory is still 190.8MB. Free memory was 152.7MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 663.55ms. Allocated memory is still 190.8MB. Free memory was 150.3MB in the beginning and 125.3MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * IcfgTransformer took 158.75ms. Allocated memory is still 190.8MB. Free memory was 125.3MB in the beginning and 158.5MB in the end (delta: -33.1MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 23366.18ms. Allocated memory was 190.8MB in the beginning and 634.4MB in the end (delta: 443.5MB). Free memory was 158.0MB in the beginning and 406.6MB in the end (delta: -248.6MB). Peak memory consumption was 415.1MB. 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: 23.2s, OverallIterations: 26, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2181 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2181 mSDsluCounter, 8472 SdHoareTripleChecker+Invalid, 2.4s 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.1s 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: 2.0s 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.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.4s 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-10 21:42:32,939 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...