/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_LAZY.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:52:28,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:52:28,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:52:28,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:52:28,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:52:28,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:52:28,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:52:28,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:52:28,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:52:28,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:52:28,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:52:28,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:52:28,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:52:28,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:52:28,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:52:28,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:52:28,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:52:28,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:52:28,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:52:28,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:52:28,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:52:28,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:52:28,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:52:28,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:52:28,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:52:28,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:52:28,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:52:28,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:52:28,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:52:28,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:52:28,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:52:28,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:52:28,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:52:28,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:52:28,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:52:28,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:52:28,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:52:28,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:52:28,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:52:28,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:52:28,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:52:28,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:52:28,702 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:52:28,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:52:28,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:52:28,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:52:28,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:52:28,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:52:28,704 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:52:28,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:52:28,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:52:28,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:52:28,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:52:28,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:52:28,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:52:28,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:52:28,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:28,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:52:28,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:52:28,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:52:28,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:52:28,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:52:28,708 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:52:28,708 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:52:28,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:52:28,708 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:52:28,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:52:28,709 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:52:28,709 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 15:52:28,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:52:28,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:52:28,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:52:28,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:52:28,995 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:52:28,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c [2022-01-10 15:52:29,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b31a037/25741d9c059249268ce015d348032317/FLAG0947500fa [2022-01-10 15:52:29,450 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:52:29,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c [2022-01-10 15:52:29,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b31a037/25741d9c059249268ce015d348032317/FLAG0947500fa [2022-01-10 15:52:29,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b31a037/25741d9c059249268ce015d348032317 [2022-01-10 15:52:29,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:52:29,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:52:29,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:29,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:52:29,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:52:29,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:29" (1/1) ... [2022-01-10 15:52:29,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78035e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:29, skipping insertion in model container [2022-01-10 15:52:29,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:29" (1/1) ... [2022-01-10 15:52:29,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:52:29,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:52:30,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c[43387,43400] [2022-01-10 15:52:30,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:30,154 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:52:30,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1.cil-2.c[43387,43400] [2022-01-10 15:52:30,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:30,251 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:52:30,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30 WrapperNode [2022-01-10 15:52:30,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:30,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:30,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:52:30,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:52:30,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,324 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 503 [2022-01-10 15:52:30,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:30,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:52:30,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:52:30,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:52:30,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:52:30,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:52:30,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:52:30,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:52:30,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (1/1) ... [2022-01-10 15:52:30,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:30,416 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 15:52:30,439 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 15:52:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:52:30,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:52:30,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:52:30,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:52:30,550 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:52:30,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:52:30,562 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:52:30,999 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 15:52:30,999 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 15:52:31,000 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:52:31,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:52:31,006 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:52:31,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:31 BoogieIcfgContainer [2022-01-10 15:52:31,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:52:31,009 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:52:31,009 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:52:31,010 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:52:31,012 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:31" (1/1) ... [2022-01-10 15:52:31,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:31 BasicIcfg [2022-01-10 15:52:31,202 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:52:31,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:52:31,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:52:31,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:52:31,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:52:29" (1/4) ... [2022-01-10 15:52:31,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f621144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:31, skipping insertion in model container [2022-01-10 15:52:31,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:30" (2/4) ... [2022-01-10 15:52:31,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f621144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:31, skipping insertion in model container [2022-01-10 15:52:31,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:31" (3/4) ... [2022-01-10 15:52:31,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f621144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:31, skipping insertion in model container [2022-01-10 15:52:31,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:31" (4/4) ... [2022-01-10 15:52:31,209 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.cTransformedIcfg [2022-01-10 15:52:31,214 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:52:31,214 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:52:31,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:52:31,266 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 15:52:31,267 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:52:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 15:52:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 15:52:31,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:31,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:31,303 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1783667994, now seen corresponding path program 1 times [2022-01-10 15:52:31,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197922946] [2022-01-10 15:52:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:31,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:31,613 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 15:52:31,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:31,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197922946] [2022-01-10 15:52:31,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197922946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:31,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:31,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:31,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928525175] [2022-01-10 15:52:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:31,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:31,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:31,656 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 0 states have call successors, (0), 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 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:31,770 INFO L93 Difference]: Finished difference Result 411 states and 697 transitions. [2022-01-10 15:52:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 15:52:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:31,791 INFO L225 Difference]: With dead ends: 411 [2022-01-10 15:52:31,791 INFO L226 Difference]: Without dead ends: 249 [2022-01-10 15:52:31,795 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 15:52:31,799 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 186 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 448 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 15:52:31,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 448 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-10 15:52:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-01-10 15:52:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.5241935483870968) internal successors, (378), 248 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 15:52:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 378 transitions. [2022-01-10 15:52:31,866 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 378 transitions. Word has length 45 [2022-01-10 15:52:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:31,868 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 378 transitions. [2022-01-10 15:52:31,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 378 transitions. [2022-01-10 15:52:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 15:52:31,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:31,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:31,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:52:31,877 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1904547348, now seen corresponding path program 1 times [2022-01-10 15:52:31,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:31,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847857766] [2022-01-10 15:52:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:31,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:52:31,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:31,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847857766] [2022-01-10 15:52:31,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847857766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:31,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:31,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:31,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691522322] [2022-01-10 15:52:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:31,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:31,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:31,990 INFO L87 Difference]: Start difference. First operand 249 states and 378 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:32,158 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-01-10 15:52:32,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-01-10 15:52:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:32,162 INFO L225 Difference]: With dead ends: 400 [2022-01-10 15:52:32,162 INFO L226 Difference]: Without dead ends: 278 [2022-01-10 15:52:32,169 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 15:52:32,170 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:32,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 314 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-01-10 15:52:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 270. [2022-01-10 15:52:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.5018587360594795) internal successors, (404), 269 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 15:52:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 404 transitions. [2022-01-10 15:52:32,193 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 404 transitions. Word has length 61 [2022-01-10 15:52:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:32,193 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 404 transitions. [2022-01-10 15:52:32,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 404 transitions. [2022-01-10 15:52:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 15:52:32,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:32,196 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:32,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:52:32,196 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:32,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1082953713, now seen corresponding path program 1 times [2022-01-10 15:52:32,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:32,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842674053] [2022-01-10 15:52:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:32,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 15:52:32,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:32,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842674053] [2022-01-10 15:52:32,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842674053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:32,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:32,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:32,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452837429] [2022-01-10 15:52:32,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:32,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:32,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:32,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:32,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:32,328 INFO L87 Difference]: Start difference. First operand 270 states and 404 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 15:52:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:32,499 INFO L93 Difference]: Finished difference Result 624 states and 961 transitions. [2022-01-10 15:52:32,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:32,500 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 82 [2022-01-10 15:52:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:32,502 INFO L225 Difference]: With dead ends: 624 [2022-01-10 15:52:32,502 INFO L226 Difference]: Without dead ends: 362 [2022-01-10 15:52:32,503 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 15:52:32,503 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:32,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 315 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-01-10 15:52:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 354. [2022-01-10 15:52:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.4107648725212465) internal successors, (498), 353 states have internal predecessors, (498), 0 states have call successors, (0), 0 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 15:52:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 498 transitions. [2022-01-10 15:52:32,515 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 498 transitions. Word has length 82 [2022-01-10 15:52:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:32,515 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 498 transitions. [2022-01-10 15:52:32,515 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 15:52:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 498 transitions. [2022-01-10 15:52:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 15:52:32,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:32,518 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:32,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:52:32,518 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:32,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1531650352, now seen corresponding path program 1 times [2022-01-10 15:52:32,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:32,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554269788] [2022-01-10 15:52:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:32,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 15:52:32,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:32,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554269788] [2022-01-10 15:52:32,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554269788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:32,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:32,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:32,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657368677] [2022-01-10 15:52:32,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:32,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:32,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:32,570 INFO L87 Difference]: Start difference. First operand 354 states and 498 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 15:52:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:32,721 INFO L93 Difference]: Finished difference Result 754 states and 1078 transitions. [2022-01-10 15:52:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:32,722 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 82 [2022-01-10 15:52:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:32,724 INFO L225 Difference]: With dead ends: 754 [2022-01-10 15:52:32,724 INFO L226 Difference]: Without dead ends: 408 [2022-01-10 15:52:32,725 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 15:52:32,726 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:32,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 315 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-01-10 15:52:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2022-01-10 15:52:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.3884711779448622) internal successors, (554), 399 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 15:52:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 554 transitions. [2022-01-10 15:52:32,736 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 554 transitions. Word has length 82 [2022-01-10 15:52:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:32,736 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 554 transitions. [2022-01-10 15:52:32,737 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 15:52:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 554 transitions. [2022-01-10 15:52:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 15:52:32,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:32,738 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:32,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:52:32,739 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash -296520660, now seen corresponding path program 1 times [2022-01-10 15:52:32,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:32,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415947615] [2022-01-10 15:52:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:32,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 15:52:32,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:32,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415947615] [2022-01-10 15:52:32,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415947615] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:32,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:32,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:32,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167497063] [2022-01-10 15:52:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:32,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:32,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:32,799 INFO L87 Difference]: Start difference. First operand 400 states and 554 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:32,937 INFO L93 Difference]: Finished difference Result 868 states and 1230 transitions. [2022-01-10 15:52:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-10 15:52:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:32,940 INFO L225 Difference]: With dead ends: 868 [2022-01-10 15:52:32,940 INFO L226 Difference]: Without dead ends: 476 [2022-01-10 15:52:32,941 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 15:52:32,942 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 29 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:32,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 314 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-01-10 15:52:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2022-01-10 15:52:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.3674832962138084) internal successors, (614), 449 states have internal predecessors, (614), 0 states have call successors, (0), 0 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 15:52:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 614 transitions. [2022-01-10 15:52:32,952 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 614 transitions. Word has length 103 [2022-01-10 15:52:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:32,953 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 614 transitions. [2022-01-10 15:52:32,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 614 transitions. [2022-01-10 15:52:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-10 15:52:32,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:32,955 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:32,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:52:32,955 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash 237502783, now seen corresponding path program 1 times [2022-01-10 15:52:32,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:32,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642025225] [2022-01-10 15:52:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:32,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 15:52:33,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:33,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642025225] [2022-01-10 15:52:33,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642025225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:33,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:33,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:33,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302729340] [2022-01-10 15:52:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:33,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:33,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:33,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,017 INFO L87 Difference]: Start difference. First operand 450 states and 614 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 15:52:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:33,057 INFO L93 Difference]: Finished difference Result 914 states and 1249 transitions. [2022-01-10 15:52:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:33,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-01-10 15:52:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:33,060 INFO L225 Difference]: With dead ends: 914 [2022-01-10 15:52:33,060 INFO L226 Difference]: Without dead ends: 681 [2022-01-10 15:52:33,061 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 15:52:33,062 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 149 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:33,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 365 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-01-10 15:52:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2022-01-10 15:52:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.3661764705882353) internal successors, (929), 680 states have internal predecessors, (929), 0 states have call successors, (0), 0 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 15:52:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 929 transitions. [2022-01-10 15:52:33,077 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 929 transitions. Word has length 122 [2022-01-10 15:52:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:33,077 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 929 transitions. [2022-01-10 15:52:33,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 15:52:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 929 transitions. [2022-01-10 15:52:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 15:52:33,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:33,079 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 15:52:33,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:52:33,080 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1140917005, now seen corresponding path program 1 times [2022-01-10 15:52:33,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:33,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041679663] [2022-01-10 15:52:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:33,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 15:52:33,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:33,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041679663] [2022-01-10 15:52:33,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041679663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:33,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:33,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:33,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224727763] [2022-01-10 15:52:33,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:33,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:33,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:33,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:33,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,148 INFO L87 Difference]: Start difference. First operand 681 states and 929 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:33,304 INFO L93 Difference]: Finished difference Result 1513 states and 2128 transitions. [2022-01-10 15:52:33,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:33,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-10 15:52:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:33,308 INFO L225 Difference]: With dead ends: 1513 [2022-01-10 15:52:33,308 INFO L226 Difference]: Without dead ends: 840 [2022-01-10 15:52:33,309 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 15:52:33,311 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 32 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:33,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 304 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-01-10 15:52:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 804. [2022-01-10 15:52:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 1.339975093399751) internal successors, (1076), 803 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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 15:52:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1076 transitions. [2022-01-10 15:52:33,333 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1076 transitions. Word has length 160 [2022-01-10 15:52:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:33,334 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1076 transitions. [2022-01-10 15:52:33,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1076 transitions. [2022-01-10 15:52:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-01-10 15:52:33,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:33,339 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:33,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:52:33,340 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:33,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -372630729, now seen corresponding path program 1 times [2022-01-10 15:52:33,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:33,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076754292] [2022-01-10 15:52:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:33,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-01-10 15:52:33,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:33,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076754292] [2022-01-10 15:52:33,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076754292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:33,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:33,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:33,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558464855] [2022-01-10 15:52:33,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:33,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:33,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:33,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,434 INFO L87 Difference]: Start difference. First operand 804 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 15:52:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:33,563 INFO L93 Difference]: Finished difference Result 1705 states and 2329 transitions. [2022-01-10 15:52:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 167 [2022-01-10 15:52:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:33,567 INFO L225 Difference]: With dead ends: 1705 [2022-01-10 15:52:33,568 INFO L226 Difference]: Without dead ends: 909 [2022-01-10 15:52:33,569 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 15:52:33,570 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 18 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:33,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 314 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-01-10 15:52:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 885. [2022-01-10 15:52:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.3257918552036199) internal successors, (1172), 884 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 15:52:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1172 transitions. [2022-01-10 15:52:33,620 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1172 transitions. Word has length 167 [2022-01-10 15:52:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:33,620 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1172 transitions. [2022-01-10 15:52:33,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 15:52:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1172 transitions. [2022-01-10 15:52:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-01-10 15:52:33,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:33,623 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:33,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:52:33,623 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1689113359, now seen corresponding path program 1 times [2022-01-10 15:52:33,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:33,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882946119] [2022-01-10 15:52:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:33,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 15:52:33,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:33,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882946119] [2022-01-10 15:52:33,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882946119] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:33,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:33,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:33,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269361172] [2022-01-10 15:52:33,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:33,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:33,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:33,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:33,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,687 INFO L87 Difference]: Start difference. First operand 885 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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 15:52:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:33,844 INFO L93 Difference]: Finished difference Result 1935 states and 2629 transitions. [2022-01-10 15:52:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 174 [2022-01-10 15:52:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:33,848 INFO L225 Difference]: With dead ends: 1935 [2022-01-10 15:52:33,849 INFO L226 Difference]: Without dead ends: 1055 [2022-01-10 15:52:33,850 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 15:52:33,852 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 163 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:33,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 161 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-01-10 15:52:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1038. [2022-01-10 15:52:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.373191899710704) internal successors, (1424), 1037 states have internal predecessors, (1424), 0 states have call successors, (0), 0 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 15:52:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1424 transitions. [2022-01-10 15:52:33,876 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1424 transitions. Word has length 174 [2022-01-10 15:52:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:33,876 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1424 transitions. [2022-01-10 15:52:33,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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 15:52:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1424 transitions. [2022-01-10 15:52:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-10 15:52:33,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:33,882 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:33,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:52:33,882 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash -759289979, now seen corresponding path program 1 times [2022-01-10 15:52:33,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:33,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502092856] [2022-01-10 15:52:33,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:33,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-01-10 15:52:33,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:33,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502092856] [2022-01-10 15:52:33,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502092856] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:33,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:33,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:33,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905483532] [2022-01-10 15:52:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:33,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:33,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:33,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:33,973 INFO L87 Difference]: Start difference. First operand 1038 states and 1424 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 15:52:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:34,102 INFO L93 Difference]: Finished difference Result 2161 states and 2995 transitions. [2022-01-10 15:52:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:34,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 190 [2022-01-10 15:52:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:34,106 INFO L225 Difference]: With dead ends: 2161 [2022-01-10 15:52:34,107 INFO L226 Difference]: Without dead ends: 1131 [2022-01-10 15:52:34,108 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 15:52:34,108 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 10 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:34,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 314 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-01-10 15:52:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1125. [2022-01-10 15:52:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3576512455516014) internal successors, (1526), 1124 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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 15:52:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1526 transitions. [2022-01-10 15:52:34,132 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1526 transitions. Word has length 190 [2022-01-10 15:52:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:34,133 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1526 transitions. [2022-01-10 15:52:34,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 15:52:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1526 transitions. [2022-01-10 15:52:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 15:52:34,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:34,136 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 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 15:52:34,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:52:34,136 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1226958971, now seen corresponding path program 1 times [2022-01-10 15:52:34,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:34,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836405677] [2022-01-10 15:52:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:34,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-01-10 15:52:34,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:34,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836405677] [2022-01-10 15:52:34,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836405677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:34,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:34,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:34,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148557661] [2022-01-10 15:52:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:34,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:34,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:34,236 INFO L87 Difference]: Start difference. First operand 1125 states and 1526 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 15:52:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:34,372 INFO L93 Difference]: Finished difference Result 2335 states and 3205 transitions. [2022-01-10 15:52:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:34,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 195 [2022-01-10 15:52:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:34,377 INFO L225 Difference]: With dead ends: 2335 [2022-01-10 15:52:34,379 INFO L226 Difference]: Without dead ends: 1218 [2022-01-10 15:52:34,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:34,383 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:34,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 295 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-01-10 15:52:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2022-01-10 15:52:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 1.342645850451931) internal successors, (1634), 1217 states have internal predecessors, (1634), 0 states have call successors, (0), 0 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 15:52:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1634 transitions. [2022-01-10 15:52:34,440 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1634 transitions. Word has length 195 [2022-01-10 15:52:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:34,440 INFO L470 AbstractCegarLoop]: Abstraction has 1218 states and 1634 transitions. [2022-01-10 15:52:34,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 15:52:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1634 transitions. [2022-01-10 15:52:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-01-10 15:52:34,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:34,444 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:34,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:52:34,444 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1667240194, now seen corresponding path program 1 times [2022-01-10 15:52:34,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:34,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988360882] [2022-01-10 15:52:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:34,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 320 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 15:52:34,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:34,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988360882] [2022-01-10 15:52:34,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988360882] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:34,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058106893] [2022-01-10 15:52:34,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:34,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:34,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:34,551 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 15:52:34,592 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 15:52:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:34,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:52:34,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-01-10 15:52:35,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:35,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058106893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:35,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:35,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:35,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137546609] [2022-01-10 15:52:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:35,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:35,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:35,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:35,226 INFO L87 Difference]: Start difference. First operand 1218 states and 1634 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:35,274 INFO L93 Difference]: Finished difference Result 2450 states and 3287 transitions. [2022-01-10 15:52:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:35,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2022-01-10 15:52:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:35,281 INFO L225 Difference]: With dead ends: 2450 [2022-01-10 15:52:35,281 INFO L226 Difference]: Without dead ends: 1628 [2022-01-10 15:52:35,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 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 15:52:35,283 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 131 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:35,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 366 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-01-10 15:52:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2022-01-10 15:52:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1627 states have (on average 1.3417332513829134) internal successors, (2183), 1627 states have internal predecessors, (2183), 0 states have call successors, (0), 0 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 15:52:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2183 transitions. [2022-01-10 15:52:35,327 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2183 transitions. Word has length 224 [2022-01-10 15:52:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:35,328 INFO L470 AbstractCegarLoop]: Abstraction has 1628 states and 2183 transitions. [2022-01-10 15:52:35,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2183 transitions. [2022-01-10 15:52:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-10 15:52:35,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:35,334 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:35,364 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 15:52:35,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 15:52:35,555 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1019854610, now seen corresponding path program 1 times [2022-01-10 15:52:35,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:35,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36566754] [2022-01-10 15:52:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:35,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-01-10 15:52:35,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36566754] [2022-01-10 15:52:35,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36566754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:35,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:35,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:35,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804890553] [2022-01-10 15:52:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:35,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:35,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:35,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:35,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:35,631 INFO L87 Difference]: Start difference. First operand 1628 states and 2183 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:35,815 INFO L93 Difference]: Finished difference Result 3416 states and 4658 transitions. [2022-01-10 15:52:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2022-01-10 15:52:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:35,822 INFO L225 Difference]: With dead ends: 3416 [2022-01-10 15:52:35,822 INFO L226 Difference]: Without dead ends: 1620 [2022-01-10 15:52:35,825 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 15:52:35,826 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 9 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:35,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 314 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2022-01-10 15:52:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2022-01-10 15:52:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.336009882643607) internal successors, (2163), 1619 states have internal predecessors, (2163), 0 states have call successors, (0), 0 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 15:52:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2163 transitions. [2022-01-10 15:52:35,883 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2163 transitions. Word has length 232 [2022-01-10 15:52:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:35,884 INFO L470 AbstractCegarLoop]: Abstraction has 1620 states and 2163 transitions. [2022-01-10 15:52:35,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2163 transitions. [2022-01-10 15:52:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-01-10 15:52:35,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:35,889 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:35,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:52:35,890 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2064389218, now seen corresponding path program 1 times [2022-01-10 15:52:35,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:35,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520171215] [2022-01-10 15:52:35,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:35,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-01-10 15:52:35,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:35,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520171215] [2022-01-10 15:52:35,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520171215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:35,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:35,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:35,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661649520] [2022-01-10 15:52:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:35,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:35,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:35,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:35,985 INFO L87 Difference]: Start difference. First operand 1620 states and 2163 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 15:52:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:36,043 INFO L93 Difference]: Finished difference Result 4740 states and 6341 transitions. [2022-01-10 15:52:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:36,044 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 272 [2022-01-10 15:52:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:36,050 INFO L225 Difference]: With dead ends: 4740 [2022-01-10 15:52:36,051 INFO L226 Difference]: Without dead ends: 1997 [2022-01-10 15:52:36,054 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 15:52:36,056 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 121 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:36,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 560 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2022-01-10 15:52:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2022-01-10 15:52:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1994 states have (on average 1.3319959879638916) internal successors, (2656), 1994 states have internal predecessors, (2656), 0 states have call successors, (0), 0 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 15:52:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2656 transitions. [2022-01-10 15:52:36,104 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2656 transitions. Word has length 272 [2022-01-10 15:52:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:36,105 INFO L470 AbstractCegarLoop]: Abstraction has 1995 states and 2656 transitions. [2022-01-10 15:52:36,105 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 15:52:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2656 transitions. [2022-01-10 15:52:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-01-10 15:52:36,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:36,111 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:52:36,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:52:36,111 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:36,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:36,111 INFO L85 PathProgramCache]: Analyzing trace with hash -659681988, now seen corresponding path program 1 times [2022-01-10 15:52:36,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:36,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773479391] [2022-01-10 15:52:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:36,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2022-01-10 15:52:36,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773479391] [2022-01-10 15:52:36,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773479391] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563123160] [2022-01-10 15:52:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:36,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:36,219 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 15:52:36,220 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 15:52:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:36,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:52:36,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2022-01-10 15:52:37,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:37,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563123160] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:37,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:37,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:37,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437186073] [2022-01-10 15:52:37,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:37,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:37,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:37,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:37,010 INFO L87 Difference]: Start difference. First operand 1995 states and 2656 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 15:52:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:37,061 INFO L93 Difference]: Finished difference Result 2783 states and 3706 transitions. [2022-01-10 15:52:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:37,062 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 376 [2022-01-10 15:52:37,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:37,071 INFO L225 Difference]: With dead ends: 2783 [2022-01-10 15:52:37,072 INFO L226 Difference]: Without dead ends: 2781 [2022-01-10 15:52:37,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 376 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 15:52:37,074 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 139 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 360 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 15:52:37,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 360 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2022-01-10 15:52:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. [2022-01-10 15:52:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.3320143884892086) internal successors, (3703), 2780 states have internal predecessors, (3703), 0 states have call successors, (0), 0 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 15:52:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3703 transitions. [2022-01-10 15:52:37,139 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3703 transitions. Word has length 376 [2022-01-10 15:52:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:37,140 INFO L470 AbstractCegarLoop]: Abstraction has 2781 states and 3703 transitions. [2022-01-10 15:52:37,140 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 15:52:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3703 transitions. [2022-01-10 15:52:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-01-10 15:52:37,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:37,150 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 15:52:37,176 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 15:52:37,371 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,SelfDestructingSolverStorable14 [2022-01-10 15:52:37,371 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1300566872, now seen corresponding path program 1 times [2022-01-10 15:52:37,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:37,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399674774] [2022-01-10 15:52:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:37,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-01-10 15:52:37,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:37,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399674774] [2022-01-10 15:52:37,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399674774] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:37,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462683349] [2022-01-10 15:52:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:37,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:37,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:37,485 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 15:52:37,507 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 15:52:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:37,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 1689 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:37,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2022-01-10 15:52:39,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:39,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462683349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:39,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:39,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:39,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265744764] [2022-01-10 15:52:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:39,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:39,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:39,261 INFO L87 Difference]: Start difference. First operand 2781 states and 3703 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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 15:52:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:39,302 INFO L93 Difference]: Finished difference Result 3128 states and 4171 transitions. [2022-01-10 15:52:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 447 [2022-01-10 15:52:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:39,312 INFO L225 Difference]: With dead ends: 3128 [2022-01-10 15:52:39,312 INFO L226 Difference]: Without dead ends: 2368 [2022-01-10 15:52:39,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 447 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 15:52:39,314 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 101 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:39,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 545 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-01-10 15:52:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2023. [2022-01-10 15:52:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 2022 states have (on average 1.3323442136498516) internal successors, (2694), 2022 states have internal predecessors, (2694), 0 states have call successors, (0), 0 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 15:52:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2694 transitions. [2022-01-10 15:52:39,400 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2694 transitions. Word has length 447 [2022-01-10 15:52:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:39,400 INFO L470 AbstractCegarLoop]: Abstraction has 2023 states and 2694 transitions. [2022-01-10 15:52:39,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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 15:52:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2694 transitions. [2022-01-10 15:52:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-01-10 15:52:39,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:39,410 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:39,436 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 15:52:39,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:39,636 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -808466377, now seen corresponding path program 1 times [2022-01-10 15:52:39,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:39,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820661147] [2022-01-10 15:52:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:39,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-01-10 15:52:39,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:39,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820661147] [2022-01-10 15:52:39,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820661147] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:39,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739577641] [2022-01-10 15:52:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:39,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:39,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:39,761 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 15:52:39,762 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 15:52:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:40,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:40,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-01-10 15:52:40,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-01-10 15:52:41,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739577641] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:41,202 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:41,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:41,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108348923] [2022-01-10 15:52:41,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:41,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:41,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:41,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:41,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:41,204 INFO L87 Difference]: Start difference. First operand 2023 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 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 15:52:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:41,669 INFO L93 Difference]: Finished difference Result 4782 states and 6470 transitions. [2022-01-10 15:52:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 15:52:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 447 [2022-01-10 15:52:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:41,678 INFO L225 Difference]: With dead ends: 4782 [2022-01-10 15:52:41,678 INFO L226 Difference]: Without dead ends: 2634 [2022-01-10 15:52:41,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 894 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 15:52:41,681 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 451 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:41,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 578 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:52:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-01-10 15:52:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2052. [2022-01-10 15:52:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 2051 states have (on average 1.325694783032667) internal successors, (2719), 2051 states have internal predecessors, (2719), 0 states have call successors, (0), 0 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 15:52:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2719 transitions. [2022-01-10 15:52:41,738 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2719 transitions. Word has length 447 [2022-01-10 15:52:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:41,738 INFO L470 AbstractCegarLoop]: Abstraction has 2052 states and 2719 transitions. [2022-01-10 15:52:41,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 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 15:52:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2719 transitions. [2022-01-10 15:52:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2022-01-10 15:52:41,753 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:41,753 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 12, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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 15:52:41,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 15:52:41,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-10 15:52:41,967 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:41,968 INFO L85 PathProgramCache]: Analyzing trace with hash -785169807, now seen corresponding path program 1 times [2022-01-10 15:52:41,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:41,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470998554] [2022-01-10 15:52:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:41,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 2170 proven. 0 refuted. 0 times theorem prover too weak. 2392 trivial. 0 not checked. [2022-01-10 15:52:42,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:42,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470998554] [2022-01-10 15:52:42,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470998554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:42,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:42,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:42,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918534329] [2022-01-10 15:52:42,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:42,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:42,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:42,088 INFO L87 Difference]: Start difference. First operand 2052 states and 2719 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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 15:52:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:42,252 INFO L93 Difference]: Finished difference Result 4312 states and 5798 transitions. [2022-01-10 15:52:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 656 [2022-01-10 15:52:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:42,260 INFO L225 Difference]: With dead ends: 4312 [2022-01-10 15:52:42,260 INFO L226 Difference]: Without dead ends: 2268 [2022-01-10 15:52:42,262 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 15:52:42,262 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:42,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2022-01-10 15:52:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2256. [2022-01-10 15:52:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.3095343680709535) internal successors, (2953), 2255 states have internal predecessors, (2953), 0 states have call successors, (0), 0 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 15:52:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 2953 transitions. [2022-01-10 15:52:42,313 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 2953 transitions. Word has length 656 [2022-01-10 15:52:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:42,314 INFO L470 AbstractCegarLoop]: Abstraction has 2256 states and 2953 transitions. [2022-01-10 15:52:42,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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 15:52:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2953 transitions. [2022-01-10 15:52:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2022-01-10 15:52:42,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:42,322 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 21, 21, 20, 20, 19, 19, 18, 18, 18, 18, 15, 12, 12, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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 15:52:42,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 15:52:42,322 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1921984039, now seen corresponding path program 1 times [2022-01-10 15:52:42,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:42,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592575943] [2022-01-10 15:52:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:42,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2953 proven. 0 refuted. 0 times theorem prover too weak. 3223 trivial. 0 not checked. [2022-01-10 15:52:42,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:42,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592575943] [2022-01-10 15:52:42,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592575943] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:42,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:42,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:42,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77348170] [2022-01-10 15:52:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:42,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:42,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:42,460 INFO L87 Difference]: Start difference. First operand 2256 states and 2953 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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 15:52:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:42,611 INFO L93 Difference]: Finished difference Result 4732 states and 6290 transitions. [2022-01-10 15:52:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 749 [2022-01-10 15:52:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:42,620 INFO L225 Difference]: With dead ends: 4732 [2022-01-10 15:52:42,620 INFO L226 Difference]: Without dead ends: 2484 [2022-01-10 15:52:42,624 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 15:52:42,624 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:42,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-01-10 15:52:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2472. [2022-01-10 15:52:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2471 states have (on average 1.2946175637393769) internal successors, (3199), 2471 states have internal predecessors, (3199), 0 states have call successors, (0), 0 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 15:52:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3199 transitions. [2022-01-10 15:52:42,679 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3199 transitions. Word has length 749 [2022-01-10 15:52:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:42,680 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 3199 transitions. [2022-01-10 15:52:42,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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 15:52:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3199 transitions. [2022-01-10 15:52:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2022-01-10 15:52:42,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:42,689 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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 15:52:42,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 15:52:42,689 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1546892371, now seen corresponding path program 1 times [2022-01-10 15:52:42,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:42,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032251373] [2022-01-10 15:52:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:42,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-01-10 15:52:42,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:42,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032251373] [2022-01-10 15:52:42,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032251373] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:42,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427056537] [2022-01-10 15:52:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:42,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:42,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:42,880 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 15:52:42,906 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 15:52:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:43,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 3093 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:43,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-01-10 15:52:44,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-01-10 15:52:45,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427056537] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:45,435 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:45,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:45,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489392992] [2022-01-10 15:52:45,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:45,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:45,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:45,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:45,438 INFO L87 Difference]: Start difference. First operand 2472 states and 3199 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 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 15:52:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:45,829 INFO L93 Difference]: Finished difference Result 4344 states and 5692 transitions. [2022-01-10 15:52:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 15:52:45,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 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 848 [2022-01-10 15:52:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:45,839 INFO L225 Difference]: With dead ends: 4344 [2022-01-10 15:52:45,839 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:52:45,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1704 GetRequests, 1697 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 15:52:45,845 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 218 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:45,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 797 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 15:52:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:52:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:52:45,851 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 15:52:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:52:45,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 848 [2022-01-10 15:52:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:45,852 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:52:45,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 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 15:52:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:52:45,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:52:45,855 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:52:45,886 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 15:52:46,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:46,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:52:48,865 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:52:48,865 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:52:48,865 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-10 15:52:48,865 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-10 15:52:48,866 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-10 15:52:48,866 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-10 15:52:48,866 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-10 15:52:48,866 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 84 626) no Hoare annotation was computed. [2022-01-10 15:52:48,866 INFO L861 garLoopResultBuilder]: At program point L623(lines 23 627) the Hoare annotation is: true [2022-01-10 15:52:48,866 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 614) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 15:52:48,866 INFO L861 garLoopResultBuilder]: At program point L642(lines 633 644) the Hoare annotation is: true [2022-01-10 15:52:48,866 INFO L861 garLoopResultBuilder]: At program point L615(lines 109 616) the Hoare annotation is: true [2022-01-10 15:52:48,866 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 595) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 595) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 594) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 594) the Hoare annotation is: (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 593) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 592) no Hoare annotation was computed. [2022-01-10 15:52:48,867 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 591) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 590) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 590) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 589) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 237 244) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 588) no Hoare annotation was computed. [2022-01-10 15:52:48,868 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 249) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L854 garLoopResultBuilder]: At program point L559(lines 110 614) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 15:52:48,869 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 588) the Hoare annotation is: (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 587) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L251(lines 251 262) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L597(lines 597 611) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 612) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 587) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 586) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L598(lines 598 603) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 285) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 585) no Hoare annotation was computed. [2022-01-10 15:52:48,869 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 602) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L283-2(lines 219 558) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 584) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 584) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 583) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 298) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 582) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L296-2(lines 219 558) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 582) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 581) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L313(lines 313 320) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 580) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L302-2(lines 302 306) no Hoare annotation was computed. [2022-01-10 15:52:48,870 INFO L858 garLoopResultBuilder]: For program point L313-2(lines 313 320) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L317(lines 317 319) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 580) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 579) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 578) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L330-2(lines 219 558) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 578) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 577) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L854 garLoopResultBuilder]: At program point L361(lines 336 379) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 378) no Hoare annotation was computed. [2022-01-10 15:52:48,871 INFO L858 garLoopResultBuilder]: For program point L386(lines 386 418) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 576) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 365) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L342(lines 342 377) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 393) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L854 garLoopResultBuilder]: At program point L395(lines 386 418) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,872 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 576) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 575) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L342-1(lines 342 377) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 374) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L398(lines 398 416) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L428(lines 428 430) no Hoare annotation was computed. [2022-01-10 15:52:48,872 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 574) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 372) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L854 garLoopResultBuilder]: At program point L407(lines 398 416) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,873 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 574) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse1))) [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 573) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L437(lines 437 445) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 573) the Hoare annotation is: (or (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 572) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L352-2(lines 352 356) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-01-10 15:52:48,873 INFO L858 garLoopResultBuilder]: For program point L437-2(lines 437 445) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 571) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L360(lines 360 368) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 571) the Hoare annotation is: (or (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 570) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 569) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 569) the Hoare annotation is: (or (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 568) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-01-10 15:52:48,874 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 567) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 567) the Hoare annotation is: (or (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (<= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672))) [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 566) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 565) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L486-2(lines 219 558) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 565) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 564) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L503(lines 503 506) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 563) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-01-10 15:52:48,875 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 563) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 562) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 219 558) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L525(lines 525 531) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 561) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L517(lines 517 520) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L528-2(lines 219 558) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 530) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 561) the Hoare annotation is: true [2022-01-10 15:52:48,876 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 561) the Hoare annotation is: true [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L546(lines 546 552) no Hoare annotation was computed. [2022-01-10 15:52:48,876 INFO L858 garLoopResultBuilder]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2022-01-10 15:52:48,877 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-01-10 15:52:48,877 INFO L854 garLoopResultBuilder]: At program point L631(lines 629 632) the Hoare annotation is: false [2022-01-10 15:52:48,877 INFO L858 garLoopResultBuilder]: For program point L549(lines 549 551) no Hoare annotation was computed. [2022-01-10 15:52:48,877 INFO L858 garLoopResultBuilder]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2022-01-10 15:52:48,880 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:48,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:52:48,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:48 BasicIcfg [2022-01-10 15:52:48,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:52:48,916 INFO L158 Benchmark]: Toolchain (without parser) took 19091.81ms. Allocated memory was 183.5MB in the beginning and 382.7MB in the end (delta: 199.2MB). Free memory was 127.6MB in the beginning and 179.1MB in the end (delta: -51.5MB). Peak memory consumption was 210.8MB. Max. memory is 8.0GB. [2022-01-10 15:52:48,917 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 183.5MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:52:48,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.25ms. Allocated memory was 183.5MB in the beginning and 261.1MB in the end (delta: 77.6MB). Free memory was 127.3MB in the beginning and 228.6MB in the end (delta: -101.3MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-01-10 15:52:48,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.31ms. Allocated memory is still 261.1MB. Free memory was 228.1MB in the beginning and 225.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:48,917 INFO L158 Benchmark]: Boogie Preprocessor took 57.73ms. Allocated memory is still 261.1MB. Free memory was 225.5MB in the beginning and 223.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:48,918 INFO L158 Benchmark]: RCFGBuilder took 624.99ms. Allocated memory is still 261.1MB. Free memory was 223.4MB in the beginning and 196.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-10 15:52:48,918 INFO L158 Benchmark]: IcfgTransformer took 193.70ms. Allocated memory is still 261.1MB. Free memory was 196.1MB in the beginning and 182.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 15:52:48,918 INFO L158 Benchmark]: TraceAbstraction took 17711.96ms. Allocated memory was 261.1MB in the beginning and 382.7MB in the end (delta: 121.6MB). Free memory was 182.0MB in the beginning and 179.1MB in the end (delta: 2.9MB). Peak memory consumption was 188.0MB. Max. memory is 8.0GB. [2022-01-10 15:52:48,919 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.41ms. Allocated memory is still 183.5MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 424.25ms. Allocated memory was 183.5MB in the beginning and 261.1MB in the end (delta: 77.6MB). Free memory was 127.3MB in the beginning and 228.6MB in the end (delta: -101.3MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.31ms. Allocated memory is still 261.1MB. Free memory was 228.1MB in the beginning and 225.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.73ms. Allocated memory is still 261.1MB. Free memory was 225.5MB in the beginning and 223.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 624.99ms. Allocated memory is still 261.1MB. Free memory was 223.4MB in the beginning and 196.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * IcfgTransformer took 193.70ms. Allocated memory is still 261.1MB. Free memory was 196.1MB in the beginning and 182.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17711.96ms. Allocated memory was 261.1MB in the beginning and 382.7MB in the end (delta: 121.6MB). Free memory was 182.0MB in the beginning and 179.1MB in the end (delta: 2.9MB). Peak memory consumption was 188.0MB. 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: 630]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 20, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1833 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1833 mSDsluCounter, 7595 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3168 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2435 IncrementalHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 4427 mSDtfsCounter, 2435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3705 GetRequests, 3668 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2781occurred in iteration=15, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 1086 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 334 NumberOfFragments, 670 HoareAnnotationTreeSize, 28 FomulaSimplifications, 7311 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 6543 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 7974 NumberOfCodeBlocks, 7974 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 9242 ConstructedInterpolants, 0 QuantifiedInterpolants, 14542 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8815 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 51480/51714 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: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) || (~bvule32(blastFlag, 0bv32) && !~bvule32(8656bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 0bv32) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) && 8448bv32 == s__state) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && 8448bv32 == s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) || (~bvule32(blastFlag, 0bv32) && !~bvule32(8656bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) || (~bvule32(blastFlag, 0bv32) && !~bvule32(8656bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(s__state, 8672bv32)) || (~bvule32(blastFlag, 0bv32) && !~bvule32(8656bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 15:52:48,995 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...