/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_BITWISE.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 10:02:23,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 10:02:23,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 10:02:23,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 10:02:23,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 10:02:23,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 10:02:23,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 10:02:23,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 10:02:23,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 10:02:23,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 10:02:23,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 10:02:23,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 10:02:23,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 10:02:23,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 10:02:23,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 10:02:23,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 10:02:23,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 10:02:23,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 10:02:23,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 10:02:23,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 10:02:23,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 10:02:23,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 10:02:23,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 10:02:23,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 10:02:23,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 10:02:23,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 10:02:23,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 10:02:23,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 10:02:23,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 10:02:23,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 10:02:23,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 10:02:23,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 10:02:23,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 10:02:23,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 10:02:23,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 10:02:23,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 10:02:23,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 10:02:23,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 10:02:23,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 10:02:23,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 10:02:23,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 10:02:23,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 10:02:23,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 10:02:23,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 10:02:23,169 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 10:02:23,169 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 10:02:23,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 10:02:23,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 10:02:23,170 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 10:02:23,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 10:02:23,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 10:02:23,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 10:02:23,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 10:02:23,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 10:02:23,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 10:02:23,171 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 10:02:23,171 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 10:02:23,171 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 10:02:23,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 10:02:23,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 10:02:23,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 10:02:23,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 10:02:23,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:02:23,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 10:02:23,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 10:02:23,174 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 10:02:23,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 10:02:23,174 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 10:02:23,174 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 10:02:23,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 10:02:23,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 10:02:23,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 10:02:23,400 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 10:02:23,400 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 10:02:23,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c [2022-01-10 10:02:23,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714484b24/b69f0d8063b14fadbdb8eb74d1d494e0/FLAG36605837c [2022-01-10 10:02:23,850 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 10:02:23,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c [2022-01-10 10:02:23,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714484b24/b69f0d8063b14fadbdb8eb74d1d494e0/FLAG36605837c [2022-01-10 10:02:23,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714484b24/b69f0d8063b14fadbdb8eb74d1d494e0 [2022-01-10 10:02:23,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 10:02:23,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 10:02:23,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 10:02:23,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 10:02:23,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 10:02:23,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:02:23" (1/1) ... [2022-01-10 10:02:23,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370d9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:23, skipping insertion in model container [2022-01-10 10:02:23,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:02:23" (1/1) ... [2022-01-10 10:02:23,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 10:02:23,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 10:02:24,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c[37413,37426] [2022-01-10 10:02:24,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:02:24,158 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 10:02:24,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_3.cil-1.c[37413,37426] [2022-01-10 10:02:24,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:02:24,198 INFO L208 MainTranslator]: Completed translation [2022-01-10 10:02:24,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24 WrapperNode [2022-01-10 10:02:24,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 10:02:24,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 10:02:24,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 10:02:24,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 10:02:24,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,241 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 432 [2022-01-10 10:02:24,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 10:02:24,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 10:02:24,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 10:02:24,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 10:02:24,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 10:02:24,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 10:02:24,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 10:02:24,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 10:02:24,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:02:24,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:02:24,316 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 10:02:24,323 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 10:02:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 10:02:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 10:02:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 10:02:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 10:02:24,436 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 10:02:24,437 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 10:02:24,446 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 10:02:24,806 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 10:02:24,806 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 10:02:24,806 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 10:02:24,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 10:02:24,812 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 10:02:24,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:02:24 BoogieIcfgContainer [2022-01-10 10:02:24,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 10:02:24,814 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 10:02:24,814 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 10:02:24,815 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 10:02:24,817 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:02:24" (1/1) ... [2022-01-10 10:02:24,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:02:24 BasicIcfg [2022-01-10 10:02:24,972 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 10:02:24,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 10:02:24,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 10:02:24,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 10:02:24,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 10:02:23" (1/4) ... [2022-01-10 10:02:24,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a63a1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:02:24, skipping insertion in model container [2022-01-10 10:02:24,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:24" (2/4) ... [2022-01-10 10:02:24,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a63a1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:02:24, skipping insertion in model container [2022-01-10 10:02:24,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:02:24" (3/4) ... [2022-01-10 10:02:24,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a63a1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:02:24, skipping insertion in model container [2022-01-10 10:02:24,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:02:24" (4/4) ... [2022-01-10 10:02:24,977 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.cTransformedIcfg [2022-01-10 10:02:24,981 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 10:02:24,981 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 10:02:25,014 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 10:02:25,019 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 10:02:25,020 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 10:02:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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 10:02:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:02:25,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:25,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:25,038 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 258215262, now seen corresponding path program 1 times [2022-01-10 10:02:25,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:25,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846183025] [2022-01-10 10:02:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:25,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:02:25,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:25,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846183025] [2022-01-10 10:02:25,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846183025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:25,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:25,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:25,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383698599] [2022-01-10 10:02:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:25,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:25,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:25,275 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 123 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:25,364 INFO L93 Difference]: Finished difference Result 354 states and 608 transitions. [2022-01-10 10:02:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 10:02:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:25,378 INFO L225 Difference]: With dead ends: 354 [2022-01-10 10:02:25,379 INFO L226 Difference]: Without dead ends: 207 [2022-01-10 10:02:25,381 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 10:02:25,385 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 175 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 390 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 10:02:25,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 390 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-10 10:02:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-01-10 10:02:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.5097087378640777) internal successors, (311), 206 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 10:02:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 311 transitions. [2022-01-10 10:02:25,449 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 311 transitions. Word has length 24 [2022-01-10 10:02:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:25,451 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 311 transitions. [2022-01-10 10:02:25,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 311 transitions. [2022-01-10 10:02:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 10:02:25,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:25,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:25,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 10:02:25,453 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash -145118534, now seen corresponding path program 1 times [2022-01-10 10:02:25,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:25,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756738496] [2022-01-10 10:02:25,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:25,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:02:25,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:25,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756738496] [2022-01-10 10:02:25,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756738496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:25,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:25,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:25,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018538522] [2022-01-10 10:02:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:25,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:25,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:25,516 INFO L87 Difference]: Start difference. First operand 207 states and 311 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:27,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:27,741 INFO L93 Difference]: Finished difference Result 336 states and 510 transitions. [2022-01-10 10:02:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 10:02:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:27,743 INFO L225 Difference]: With dead ends: 336 [2022-01-10 10:02:27,743 INFO L226 Difference]: Without dead ends: 234 [2022-01-10 10:02:27,744 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 10:02:27,744 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:27,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 254 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-01-10 10:02:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 224. [2022-01-10 10:02:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.493273542600897) internal successors, (333), 223 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 10:02:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 333 transitions. [2022-01-10 10:02:27,784 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 333 transitions. Word has length 38 [2022-01-10 10:02:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:27,785 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 333 transitions. [2022-01-10 10:02:27,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 333 transitions. [2022-01-10 10:02:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 10:02:27,786 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:27,786 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:27,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 10:02:27,787 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash 670100932, now seen corresponding path program 1 times [2022-01-10 10:02:27,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:27,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539751471] [2022-01-10 10:02:27,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:27,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 10:02:27,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:27,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539751471] [2022-01-10 10:02:27,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539751471] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:27,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:27,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:27,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654871354] [2022-01-10 10:02:27,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:27,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:27,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:27,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:27,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:27,896 INFO L87 Difference]: Start difference. First operand 224 states and 333 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:29,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:30,061 INFO L93 Difference]: Finished difference Result 489 states and 736 transitions. [2022-01-10 10:02:30,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:30,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 10:02:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:30,077 INFO L225 Difference]: With dead ends: 489 [2022-01-10 10:02:30,077 INFO L226 Difference]: Without dead ends: 272 [2022-01-10 10:02:30,078 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 10:02:30,079 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:30,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 256 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-01-10 10:02:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2022-01-10 10:02:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.456273764258555) internal successors, (383), 263 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 10:02:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 383 transitions. [2022-01-10 10:02:30,089 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 383 transitions. Word has length 55 [2022-01-10 10:02:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:30,090 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 383 transitions. [2022-01-10 10:02:30,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 383 transitions. [2022-01-10 10:02:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 10:02:30,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:30,091 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:30,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 10:02:30,092 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash -574663549, now seen corresponding path program 1 times [2022-01-10 10:02:30,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:30,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928921686] [2022-01-10 10:02:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:30,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 10:02:30,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:30,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928921686] [2022-01-10 10:02:30,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928921686] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:30,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:30,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:30,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287760345] [2022-01-10 10:02:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:30,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:30,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:30,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:30,140 INFO L87 Difference]: Start difference. First operand 264 states and 383 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:32,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:32,393 INFO L93 Difference]: Finished difference Result 619 states and 929 transitions. [2022-01-10 10:02:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 10:02:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:32,394 INFO L225 Difference]: With dead ends: 619 [2022-01-10 10:02:32,395 INFO L226 Difference]: Without dead ends: 360 [2022-01-10 10:02:32,395 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 10:02:32,396 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:32,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 218 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-01-10 10:02:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 344. [2022-01-10 10:02:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.402332361516035) internal successors, (481), 343 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 10:02:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2022-01-10 10:02:32,405 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 55 [2022-01-10 10:02:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:32,405 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2022-01-10 10:02:32,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2022-01-10 10:02:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 10:02:32,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:32,407 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:32,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 10:02:32,408 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1698517373, now seen corresponding path program 1 times [2022-01-10 10:02:32,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:32,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387873013] [2022-01-10 10:02:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:32,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 10:02:32,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:32,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387873013] [2022-01-10 10:02:32,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387873013] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:32,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:32,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:32,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852272952] [2022-01-10 10:02:32,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:32,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:32,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:32,455 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 10:02:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:32,583 INFO L93 Difference]: Finished difference Result 818 states and 1170 transitions. [2022-01-10 10:02:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:32,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 79 [2022-01-10 10:02:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:32,585 INFO L225 Difference]: With dead ends: 818 [2022-01-10 10:02:32,585 INFO L226 Difference]: Without dead ends: 479 [2022-01-10 10:02:32,586 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 10:02:32,588 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 124 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:32,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 169 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-01-10 10:02:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 455. [2022-01-10 10:02:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.4361233480176212) internal successors, (652), 454 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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 10:02:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 652 transitions. [2022-01-10 10:02:32,607 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 652 transitions. Word has length 79 [2022-01-10 10:02:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:32,607 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 652 transitions. [2022-01-10 10:02:32,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 10:02:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 652 transitions. [2022-01-10 10:02:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 10:02:32,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:32,609 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:32,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 10:02:32,609 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1439681457, now seen corresponding path program 1 times [2022-01-10 10:02:32,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:32,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398509152] [2022-01-10 10:02:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:32,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 10:02:32,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:32,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398509152] [2022-01-10 10:02:32,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398509152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:32,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:32,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:32,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627109323] [2022-01-10 10:02:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:32,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:32,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:32,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:32,691 INFO L87 Difference]: Start difference. First operand 455 states and 652 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 10:02:34,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:34,888 INFO L93 Difference]: Finished difference Result 918 states and 1333 transitions. [2022-01-10 10:02:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:34,911 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 83 [2022-01-10 10:02:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:34,913 INFO L225 Difference]: With dead ends: 918 [2022-01-10 10:02:34,913 INFO L226 Difference]: Without dead ends: 503 [2022-01-10 10:02:34,914 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 10:02:34,914 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:34,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 256 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-01-10 10:02:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2022-01-10 10:02:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4193548387096775) internal successors, (704), 496 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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 10:02:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 704 transitions. [2022-01-10 10:02:34,926 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 704 transitions. Word has length 83 [2022-01-10 10:02:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:34,926 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 704 transitions. [2022-01-10 10:02:34,927 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 10:02:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 704 transitions. [2022-01-10 10:02:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 10:02:34,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:34,928 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:34,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 10:02:34,929 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1710074549, now seen corresponding path program 1 times [2022-01-10 10:02:34,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:34,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543429682] [2022-01-10 10:02:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:34,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 10:02:35,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543429682] [2022-01-10 10:02:35,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543429682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491556564] [2022-01-10 10:02:35,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,009 INFO L87 Difference]: Start difference. First operand 497 states and 704 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 10:02:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:35,035 INFO L93 Difference]: Finished difference Result 973 states and 1391 transitions. [2022-01-10 10:02:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:35,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 10:02:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:35,038 INFO L225 Difference]: With dead ends: 973 [2022-01-10 10:02:35,039 INFO L226 Difference]: Without dead ends: 734 [2022-01-10 10:02:35,039 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 10:02:35,040 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 134 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:35,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 301 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-01-10 10:02:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2022-01-10 10:02:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.4242837653478855) internal successors, (1044), 733 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 10:02:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1044 transitions. [2022-01-10 10:02:35,056 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1044 transitions. Word has length 103 [2022-01-10 10:02:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:35,057 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1044 transitions. [2022-01-10 10:02:35,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 10:02:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1044 transitions. [2022-01-10 10:02:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 10:02:35,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:35,059 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:35,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 10:02:35,060 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash 851213822, now seen corresponding path program 1 times [2022-01-10 10:02:35,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:35,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613782586] [2022-01-10 10:02:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:35,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 10:02:35,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613782586] [2022-01-10 10:02:35,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613782586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882923310] [2022-01-10 10:02:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,142 INFO L87 Difference]: Start difference. First operand 734 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:35,171 INFO L93 Difference]: Finished difference Result 973 states and 1388 transitions. [2022-01-10 10:02:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:35,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-10 10:02:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:35,175 INFO L225 Difference]: With dead ends: 973 [2022-01-10 10:02:35,175 INFO L226 Difference]: Without dead ends: 971 [2022-01-10 10:02:35,176 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 10:02:35,176 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 299 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 10:02:35,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 299 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-01-10 10:02:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2022-01-10 10:02:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.4288659793814433) internal successors, (1386), 970 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states 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 10:02:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1386 transitions. [2022-01-10 10:02:35,199 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1386 transitions. Word has length 105 [2022-01-10 10:02:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:35,199 INFO L470 AbstractCegarLoop]: Abstraction has 971 states and 1386 transitions. [2022-01-10 10:02:35,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1386 transitions. [2022-01-10 10:02:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 10:02:35,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:35,201 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:35,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 10:02:35,201 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash 939181828, now seen corresponding path program 1 times [2022-01-10 10:02:35,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:35,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244458180] [2022-01-10 10:02:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:35,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 10:02:35,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244458180] [2022-01-10 10:02:35,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244458180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838598042] [2022-01-10 10:02:35,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,246 INFO L87 Difference]: Start difference. First operand 971 states and 1386 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:37,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:37,458 INFO L93 Difference]: Finished difference Result 2102 states and 3060 transitions. [2022-01-10 10:02:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:37,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-01-10 10:02:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:37,483 INFO L225 Difference]: With dead ends: 2102 [2022-01-10 10:02:37,483 INFO L226 Difference]: Without dead ends: 1163 [2022-01-10 10:02:37,484 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 10:02:37,484 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 78 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:37,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 200 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-01-10 10:02:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1127. [2022-01-10 10:02:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.4440497335701599) internal successors, (1626), 1126 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states 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 10:02:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1626 transitions. [2022-01-10 10:02:37,520 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1626 transitions. Word has length 159 [2022-01-10 10:02:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:37,520 INFO L470 AbstractCegarLoop]: Abstraction has 1127 states and 1626 transitions. [2022-01-10 10:02:37,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1626 transitions. [2022-01-10 10:02:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 10:02:37,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:37,523 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:37,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 10:02:37,523 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:37,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash 302772068, now seen corresponding path program 1 times [2022-01-10 10:02:37,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:37,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629096860] [2022-01-10 10:02:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:37,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-01-10 10:02:37,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:37,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629096860] [2022-01-10 10:02:37,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629096860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:37,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:37,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:37,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369111071] [2022-01-10 10:02:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:37,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:37,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:37,601 INFO L87 Difference]: Start difference. First operand 1127 states and 1626 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 10:02:39,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:39,784 INFO L93 Difference]: Finished difference Result 2320 states and 3334 transitions. [2022-01-10 10:02:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:39,799 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 195 [2022-01-10 10:02:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:39,803 INFO L225 Difference]: With dead ends: 2320 [2022-01-10 10:02:39,803 INFO L226 Difference]: Without dead ends: 1233 [2022-01-10 10:02:39,804 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 10:02:39,804 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 13 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:39,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 255 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-01-10 10:02:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1219. [2022-01-10 10:02:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 1.4269293924466337) internal successors, (1738), 1218 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states 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 10:02:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1738 transitions. [2022-01-10 10:02:39,824 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1738 transitions. Word has length 195 [2022-01-10 10:02:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:39,825 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 1738 transitions. [2022-01-10 10:02:39,825 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 10:02:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1738 transitions. [2022-01-10 10:02:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-10 10:02:39,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:39,827 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:39,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 10:02:39,827 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash -525245704, now seen corresponding path program 1 times [2022-01-10 10:02:39,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:39,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229720619] [2022-01-10 10:02:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:39,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-01-10 10:02:39,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:39,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229720619] [2022-01-10 10:02:39,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229720619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:39,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:39,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:39,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787482467] [2022-01-10 10:02:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:39,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:39,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:39,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:39,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:39,887 INFO L87 Difference]: Start difference. First operand 1219 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:41,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:44,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:44,169 INFO L93 Difference]: Finished difference Result 2510 states and 3576 transitions. [2022-01-10 10:02:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2022-01-10 10:02:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:44,173 INFO L225 Difference]: With dead ends: 2510 [2022-01-10 10:02:44,173 INFO L226 Difference]: Without dead ends: 1331 [2022-01-10 10:02:44,174 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 10:02:44,175 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:44,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-01-10 10:02:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-01-10 10:02:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1319. [2022-01-10 10:02:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.409711684370258) internal successors, (1858), 1318 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states 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 10:02:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1858 transitions. [2022-01-10 10:02:44,195 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1858 transitions. Word has length 216 [2022-01-10 10:02:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:44,196 INFO L470 AbstractCegarLoop]: Abstraction has 1319 states and 1858 transitions. [2022-01-10 10:02:44,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1858 transitions. [2022-01-10 10:02:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-01-10 10:02:44,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:44,198 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:44,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 10:02:44,199 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1705203955, now seen corresponding path program 1 times [2022-01-10 10:02:44,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:44,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097744014] [2022-01-10 10:02:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:44,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-10 10:02:44,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:44,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097744014] [2022-01-10 10:02:44,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097744014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:44,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:44,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:44,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373849057] [2022-01-10 10:02:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:44,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:44,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:44,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:44,263 INFO L87 Difference]: Start difference. First operand 1319 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:46,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:48,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:48,543 INFO L93 Difference]: Finished difference Result 2718 states and 3828 transitions. [2022-01-10 10:02:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2022-01-10 10:02:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:48,547 INFO L225 Difference]: With dead ends: 2718 [2022-01-10 10:02:48,548 INFO L226 Difference]: Without dead ends: 1439 [2022-01-10 10:02:48,549 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 10:02:48,549 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:48,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 256 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-01-10 10:02:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2022-01-10 10:02:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1431. [2022-01-10 10:02:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.3916083916083917) internal successors, (1990), 1430 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states 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 10:02:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1990 transitions. [2022-01-10 10:02:48,572 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1990 transitions. Word has length 240 [2022-01-10 10:02:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:48,572 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 1990 transitions. [2022-01-10 10:02:48,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1990 transitions. [2022-01-10 10:02:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-01-10 10:02:48,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:48,575 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:48,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 10:02:48,575 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash 421292788, now seen corresponding path program 1 times [2022-01-10 10:02:48,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:48,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024652912] [2022-01-10 10:02:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:48,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-10 10:02:48,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:48,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024652912] [2022-01-10 10:02:48,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024652912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:48,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:48,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:48,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310781921] [2022-01-10 10:02:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:48,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:48,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:48,644 INFO L87 Difference]: Start difference. First operand 1431 states and 1990 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:48,772 INFO L93 Difference]: Finished difference Result 2958 states and 4128 transitions. [2022-01-10 10:02:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2022-01-10 10:02:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:48,806 INFO L225 Difference]: With dead ends: 2958 [2022-01-10 10:02:48,806 INFO L226 Difference]: Without dead ends: 1567 [2022-01-10 10:02:48,807 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 10:02:48,809 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:48,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 257 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-01-10 10:02:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1555. [2022-01-10 10:02:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1554 states have (on average 1.3732303732303732) internal successors, (2134), 1554 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states 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 10:02:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2134 transitions. [2022-01-10 10:02:48,836 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2134 transitions. Word has length 240 [2022-01-10 10:02:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:48,836 INFO L470 AbstractCegarLoop]: Abstraction has 1555 states and 2134 transitions. [2022-01-10 10:02:48,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2134 transitions. [2022-01-10 10:02:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-10 10:02:48,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:48,839 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:48,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 10:02:48,840 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1970271356, now seen corresponding path program 1 times [2022-01-10 10:02:48,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:48,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96357000] [2022-01-10 10:02:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:48,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-10 10:02:48,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:48,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96357000] [2022-01-10 10:02:48,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96357000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:48,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:48,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:48,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107733778] [2022-01-10 10:02:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:48,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:48,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:48,906 INFO L87 Difference]: Start difference. First operand 1555 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 10:02:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:48,938 INFO L93 Difference]: Finished difference Result 4469 states and 6170 transitions. [2022-01-10 10:02:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 270 [2022-01-10 10:02:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:48,946 INFO L225 Difference]: With dead ends: 4469 [2022-01-10 10:02:48,946 INFO L226 Difference]: Without dead ends: 2954 [2022-01-10 10:02:48,948 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 10:02:48,948 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 123 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:48,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 475 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2022-01-10 10:02:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2022-01-10 10:02:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 2951 states have (on average 1.3808878346323281) internal successors, (4075), 2951 states have internal predecessors, (4075), 0 states have call successors, (0), 0 states 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 10:02:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 4075 transitions. [2022-01-10 10:02:48,999 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 4075 transitions. Word has length 270 [2022-01-10 10:02:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:48,999 INFO L470 AbstractCegarLoop]: Abstraction has 2952 states and 4075 transitions. [2022-01-10 10:02:48,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 10:02:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 4075 transitions. [2022-01-10 10:02:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-10 10:02:49,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:49,004 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:49,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 10:02:49,004 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1040784773, now seen corresponding path program 1 times [2022-01-10 10:02:49,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:49,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309136604] [2022-01-10 10:02:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:49,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-01-10 10:02:49,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309136604] [2022-01-10 10:02:49,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309136604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:49,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:49,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:49,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239938357] [2022-01-10 10:02:49,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:49,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:49,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:49,077 INFO L87 Difference]: Start difference. First operand 2952 states and 4075 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:49,241 INFO L93 Difference]: Finished difference Result 6164 states and 8546 transitions. [2022-01-10 10:02:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:49,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2022-01-10 10:02:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:49,250 INFO L225 Difference]: With dead ends: 6164 [2022-01-10 10:02:49,250 INFO L226 Difference]: Without dead ends: 3252 [2022-01-10 10:02:49,253 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 10:02:49,253 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:49,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 257 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2022-01-10 10:02:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3236. [2022-01-10 10:02:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 3235 states have (on average 1.3598145285935086) internal successors, (4399), 3235 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states 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 10:02:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4399 transitions. [2022-01-10 10:02:49,308 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4399 transitions. Word has length 270 [2022-01-10 10:02:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:49,308 INFO L470 AbstractCegarLoop]: Abstraction has 3236 states and 4399 transitions. [2022-01-10 10:02:49,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4399 transitions. [2022-01-10 10:02:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-01-10 10:02:49,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:49,315 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:49,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 10:02:49,315 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1279221950, now seen corresponding path program 1 times [2022-01-10 10:02:49,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:49,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839828585] [2022-01-10 10:02:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:49,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-01-10 10:02:49,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:49,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839828585] [2022-01-10 10:02:49,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839828585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:49,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:49,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:49,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853570546] [2022-01-10 10:02:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:49,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:49,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:49,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:49,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:49,380 INFO L87 Difference]: Start difference. First operand 3236 states and 4399 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:51,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:51,614 INFO L93 Difference]: Finished difference Result 6580 states and 8962 transitions. [2022-01-10 10:02:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:51,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2022-01-10 10:02:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:51,623 INFO L225 Difference]: With dead ends: 6580 [2022-01-10 10:02:51,623 INFO L226 Difference]: Without dead ends: 3384 [2022-01-10 10:02:51,627 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 10:02:51,627 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:51,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 256 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2022-01-10 10:02:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3368. [2022-01-10 10:02:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.3516483516483517) internal successors, (4551), 3367 states have internal predecessors, (4551), 0 states have call successors, (0), 0 states 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 10:02:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4551 transitions. [2022-01-10 10:02:51,721 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4551 transitions. Word has length 294 [2022-01-10 10:02:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:51,721 INFO L470 AbstractCegarLoop]: Abstraction has 3368 states and 4551 transitions. [2022-01-10 10:02:51,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4551 transitions. [2022-01-10 10:02:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-01-10 10:02:51,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:51,726 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:51,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 10:02:51,726 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1717991461, now seen corresponding path program 1 times [2022-01-10 10:02:51,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:51,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363689118] [2022-01-10 10:02:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:51,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 10:02:51,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:51,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363689118] [2022-01-10 10:02:51,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363689118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:51,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:51,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:51,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97284561] [2022-01-10 10:02:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:51,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:51,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:51,829 INFO L87 Difference]: Start difference. First operand 3368 states and 4551 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 10:02:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:51,989 INFO L93 Difference]: Finished difference Result 7088 states and 9718 transitions. [2022-01-10 10:02:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:51,989 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 305 [2022-01-10 10:02:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:51,999 INFO L225 Difference]: With dead ends: 7088 [2022-01-10 10:02:51,999 INFO L226 Difference]: Without dead ends: 3760 [2022-01-10 10:02:52,003 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 10:02:52,004 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:52,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 250 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-01-10 10:02:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3680. [2022-01-10 10:02:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 1.337048110899701) internal successors, (4919), 3679 states have internal predecessors, (4919), 0 states have call successors, (0), 0 states 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 10:02:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4919 transitions. [2022-01-10 10:02:52,065 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4919 transitions. Word has length 305 [2022-01-10 10:02:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:52,066 INFO L470 AbstractCegarLoop]: Abstraction has 3680 states and 4919 transitions. [2022-01-10 10:02:52,066 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 10:02:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4919 transitions. [2022-01-10 10:02:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2022-01-10 10:02:52,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:52,072 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:52,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 10:02:52,072 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash -337211326, now seen corresponding path program 1 times [2022-01-10 10:02:52,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:52,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959068920] [2022-01-10 10:02:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:52,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 10:02:52,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:52,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959068920] [2022-01-10 10:02:52,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959068920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:52,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:52,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:52,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810343563] [2022-01-10 10:02:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:52,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:52,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:52,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:52,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:52,165 INFO L87 Difference]: Start difference. First operand 3680 states and 4919 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 10:02:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:52,324 INFO L93 Difference]: Finished difference Result 7720 states and 10262 transitions. [2022-01-10 10:02:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 318 [2022-01-10 10:02:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:52,345 INFO L225 Difference]: With dead ends: 7720 [2022-01-10 10:02:52,345 INFO L226 Difference]: Without dead ends: 4080 [2022-01-10 10:02:52,350 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 10:02:52,350 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 133 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:52,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 135 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2022-01-10 10:02:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3800. [2022-01-10 10:02:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 3799 states have (on average 1.3327191366148987) internal successors, (5063), 3799 states have internal predecessors, (5063), 0 states have call successors, (0), 0 states 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 10:02:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5063 transitions. [2022-01-10 10:02:52,425 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5063 transitions. Word has length 318 [2022-01-10 10:02:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:52,425 INFO L470 AbstractCegarLoop]: Abstraction has 3800 states and 5063 transitions. [2022-01-10 10:02:52,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 10:02:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5063 transitions. [2022-01-10 10:02:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2022-01-10 10:02:52,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:52,432 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:52,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 10:02:52,433 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 119047739, now seen corresponding path program 1 times [2022-01-10 10:02:52,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577816883] [2022-01-10 10:02:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:52,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 772 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2022-01-10 10:02:52,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:52,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577816883] [2022-01-10 10:02:52,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577816883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:52,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:52,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:52,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338607230] [2022-01-10 10:02:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:52,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:52,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:52,511 INFO L87 Difference]: Start difference. First operand 3800 states and 5063 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:52,566 INFO L93 Difference]: Finished difference Result 10816 states and 14501 transitions. [2022-01-10 10:02:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:52,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2022-01-10 10:02:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:52,577 INFO L225 Difference]: With dead ends: 10816 [2022-01-10 10:02:52,577 INFO L226 Difference]: Without dead ends: 7056 [2022-01-10 10:02:52,583 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 10:02:52,584 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 82 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:52,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 462 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7056 states. [2022-01-10 10:02:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7056 to 7054. [2022-01-10 10:02:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7053 states have (on average 1.3414150007089183) internal successors, (9461), 7053 states have internal predecessors, (9461), 0 states have call successors, (0), 0 states 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 10:02:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 9461 transitions. [2022-01-10 10:02:52,709 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 9461 transitions. Word has length 319 [2022-01-10 10:02:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:52,710 INFO L470 AbstractCegarLoop]: Abstraction has 7054 states and 9461 transitions. [2022-01-10 10:02:52,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 9461 transitions. [2022-01-10 10:02:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-01-10 10:02:52,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:52,718 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:52,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 10:02:52,718 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1617596952, now seen corresponding path program 1 times [2022-01-10 10:02:52,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:52,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804929339] [2022-01-10 10:02:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:52,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-01-10 10:02:52,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:52,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804929339] [2022-01-10 10:02:52,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804929339] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:52,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:52,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:52,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423365694] [2022-01-10 10:02:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:52,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:52,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:52,780 INFO L87 Difference]: Start difference. First operand 7054 states and 9461 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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 10:02:54,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:02:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:55,060 INFO L93 Difference]: Finished difference Result 14076 states and 18866 transitions. [2022-01-10 10:02:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 320 [2022-01-10 10:02:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:55,071 INFO L225 Difference]: With dead ends: 14076 [2022-01-10 10:02:55,071 INFO L226 Difference]: Without dead ends: 7062 [2022-01-10 10:02:55,079 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 10:02:55,080 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:55,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 252 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 10:02:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2022-01-10 10:02:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 7030. [2022-01-10 10:02:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7030 states, 7029 states have (on average 1.3061601934841371) internal successors, (9181), 7029 states have internal predecessors, (9181), 0 states have call successors, (0), 0 states 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 10:02:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 9181 transitions. [2022-01-10 10:02:55,221 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 9181 transitions. Word has length 320 [2022-01-10 10:02:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:55,222 INFO L470 AbstractCegarLoop]: Abstraction has 7030 states and 9181 transitions. [2022-01-10 10:02:55,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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 10:02:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 9181 transitions. [2022-01-10 10:02:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2022-01-10 10:02:55,230 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:55,230 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:55,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 10:02:55,231 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1913882228, now seen corresponding path program 1 times [2022-01-10 10:02:55,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:55,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438286314] [2022-01-10 10:02:55,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:55,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 10:02:55,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:55,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438286314] [2022-01-10 10:02:55,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438286314] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:02:55,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580028422] [2022-01-10 10:02:55,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:55,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:02:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:02:55,318 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 10:02:55,319 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 10:02:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:55,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 10:02:55,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:02:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 10:02:56,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 10:02:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 10:02:56,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580028422] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 10:02:56,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 10:02:56,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 10:02:56,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451971257] [2022-01-10 10:02:56,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 10:02:56,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 10:02:56,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:56,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 10:02:56,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 10:02:56,477 INFO L87 Difference]: Start difference. First operand 7030 states and 9181 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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 10:02:58,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:03:00,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 10:03:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:01,113 INFO L93 Difference]: Finished difference Result 14046 states and 18353 transitions. [2022-01-10 10:03:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 10:03:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 343 [2022-01-10 10:03:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:01,130 INFO L225 Difference]: With dead ends: 14046 [2022-01-10 10:03:01,130 INFO L226 Difference]: Without dead ends: 10630 [2022-01-10 10:03:01,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 686 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 10:03:01,137 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 350 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 68 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:01,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 738 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 481 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-01-10 10:03:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2022-01-10 10:03:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 8118. [2022-01-10 10:03:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8118 states, 8117 states have (on average 1.31341628680547) internal successors, (10661), 8117 states have internal predecessors, (10661), 0 states have call successors, (0), 0 states 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 10:03:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8118 states to 8118 states and 10661 transitions. [2022-01-10 10:03:01,292 INFO L78 Accepts]: Start accepts. Automaton has 8118 states and 10661 transitions. Word has length 343 [2022-01-10 10:03:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:01,293 INFO L470 AbstractCegarLoop]: Abstraction has 8118 states and 10661 transitions. [2022-01-10 10:03:01,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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 10:03:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8118 states and 10661 transitions. [2022-01-10 10:03:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-01-10 10:03:01,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:01,302 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:01,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 10:03:01,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-01-10 10:03:01,518 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1804325416, now seen corresponding path program 2 times [2022-01-10 10:03:01,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:01,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954187823] [2022-01-10 10:03:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:01,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 841 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-01-10 10:03:01,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954187823] [2022-01-10 10:03:01,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954187823] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:03:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158413147] [2022-01-10 10:03:01,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 10:03:01,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:03:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:03:01,631 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 10:03:01,632 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 10:03:01,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 10:03:01,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 10:03:01,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 10:03:01,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:03:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2022-01-10 10:03:02,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 10:03:02,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158413147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:02,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 10:03:02,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 10:03:02,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302376908] [2022-01-10 10:03:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:02,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:02,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:02,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:02,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 10:03:02,273 INFO L87 Difference]: Start difference. First operand 8118 states and 10661 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:02,482 INFO L93 Difference]: Finished difference Result 16448 states and 21586 transitions. [2022-01-10 10:03:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2022-01-10 10:03:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:02,495 INFO L225 Difference]: With dead ends: 16448 [2022-01-10 10:03:02,495 INFO L226 Difference]: Without dead ends: 8370 [2022-01-10 10:03:02,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 10:03:02,504 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:02,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 233 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:03:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8370 states. [2022-01-10 10:03:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8370 to 7542. [2022-01-10 10:03:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7542 states, 7541 states have (on average 1.260973345710118) internal successors, (9509), 7541 states have internal predecessors, (9509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7542 states to 7542 states and 9509 transitions. [2022-01-10 10:03:02,660 INFO L78 Accepts]: Start accepts. Automaton has 7542 states and 9509 transitions. Word has length 355 [2022-01-10 10:03:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:02,660 INFO L470 AbstractCegarLoop]: Abstraction has 7542 states and 9509 transitions. [2022-01-10 10:03:02,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 7542 states and 9509 transitions. [2022-01-10 10:03:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2022-01-10 10:03:02,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:02,669 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:02,688 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 10:03:02,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-10 10:03:02,887 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 441181395, now seen corresponding path program 1 times [2022-01-10 10:03:02,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:02,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302275205] [2022-01-10 10:03:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:02,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 10:03:03,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:03,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302275205] [2022-01-10 10:03:03,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302275205] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:03:03,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210367085] [2022-01-10 10:03:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:03,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:03:03,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:03:03,010 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 10:03:03,011 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 10:03:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:03,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 10:03:03,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:03:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 10:03:03,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 10:03:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 953 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 10:03:04,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210367085] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 10:03:04,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 10:03:04,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 10:03:04,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282751781] [2022-01-10 10:03:04,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 10:03:04,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 10:03:04,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 10:03:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 10:03:04,139 INFO L87 Difference]: Start difference. First operand 7542 states and 9509 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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 10:03:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:04,483 INFO L93 Difference]: Finished difference Result 17163 states and 21539 transitions. [2022-01-10 10:03:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 10:03:04,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 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 369 [2022-01-10 10:03:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:04,497 INFO L225 Difference]: With dead ends: 17163 [2022-01-10 10:03:04,498 INFO L226 Difference]: Without dead ends: 9653 [2022-01-10 10:03:04,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 10:03:04,506 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 428 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:04,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 417 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 10:03:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2022-01-10 10:03:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 7928. [2022-01-10 10:03:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7928 states, 7927 states have (on average 1.2576006055254194) internal successors, (9969), 7927 states have internal predecessors, (9969), 0 states have call successors, (0), 0 states 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 10:03:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 9969 transitions. [2022-01-10 10:03:04,620 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 9969 transitions. Word has length 369 [2022-01-10 10:03:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:04,620 INFO L470 AbstractCegarLoop]: Abstraction has 7928 states and 9969 transitions. [2022-01-10 10:03:04,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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 10:03:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 9969 transitions. [2022-01-10 10:03:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-01-10 10:03:04,628 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:04,628 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:04,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 10:03:04,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:03:04,846 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1904654198, now seen corresponding path program 1 times [2022-01-10 10:03:04,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:04,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796811611] [2022-01-10 10:03:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:04,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-01-10 10:03:04,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:04,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796811611] [2022-01-10 10:03:04,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796811611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:04,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:04,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:04,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891518143] [2022-01-10 10:03:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:04,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:04,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:04,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:04,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:04,956 INFO L87 Difference]: Start difference. First operand 7928 states and 9969 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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 10:03:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:05,113 INFO L93 Difference]: Finished difference Result 14984 states and 18458 transitions. [2022-01-10 10:03:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:05,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 408 [2022-01-10 10:03:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:05,119 INFO L225 Difference]: With dead ends: 14984 [2022-01-10 10:03:05,119 INFO L226 Difference]: Without dead ends: 3654 [2022-01-10 10:03:05,128 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 10:03:05,129 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:05,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 258 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:03:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2022-01-10 10:03:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3463. [2022-01-10 10:03:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 3462 states have (on average 1.2446562680531486) internal successors, (4309), 3462 states have internal predecessors, (4309), 0 states have call successors, (0), 0 states 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 10:03:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4309 transitions. [2022-01-10 10:03:05,170 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4309 transitions. Word has length 408 [2022-01-10 10:03:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:05,170 INFO L470 AbstractCegarLoop]: Abstraction has 3463 states and 4309 transitions. [2022-01-10 10:03:05,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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 10:03:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4309 transitions. [2022-01-10 10:03:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2022-01-10 10:03:05,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:05,175 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:05,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 10:03:05,175 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:05,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:05,175 INFO L85 PathProgramCache]: Analyzing trace with hash 213243533, now seen corresponding path program 1 times [2022-01-10 10:03:05,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:05,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039229527] [2022-01-10 10:03:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:05,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2022-01-10 10:03:05,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039229527] [2022-01-10 10:03:05,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039229527] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:03:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037914281] [2022-01-10 10:03:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:05,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:03:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:03:05,265 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 10:03:05,266 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 10:03:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:05,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 10:03:05,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:03:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2022-01-10 10:03:07,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 10:03:07,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037914281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:07,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 10:03:07,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 10:03:07,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839178407] [2022-01-10 10:03:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:07,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:07,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 10:03:07,375 INFO L87 Difference]: Start difference. First operand 3463 states and 4309 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:07,414 INFO L93 Difference]: Finished difference Result 3879 states and 4791 transitions. [2022-01-10 10:03:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:07,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2022-01-10 10:03:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:07,420 INFO L225 Difference]: With dead ends: 3879 [2022-01-10 10:03:07,420 INFO L226 Difference]: Without dead ends: 3803 [2022-01-10 10:03:07,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 492 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 10:03:07,422 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 60 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:07,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 436 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3803 states. [2022-01-10 10:03:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3803 to 3389. [2022-01-10 10:03:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 3388 states have (on average 1.2446871310507674) internal successors, (4217), 3388 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states 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 10:03:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4217 transitions. [2022-01-10 10:03:07,494 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4217 transitions. Word has length 492 [2022-01-10 10:03:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:07,495 INFO L470 AbstractCegarLoop]: Abstraction has 3389 states and 4217 transitions. [2022-01-10 10:03:07,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4217 transitions. [2022-01-10 10:03:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2022-01-10 10:03:07,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:07,502 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:07,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 10:03:07,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:03:07,721 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 511138568, now seen corresponding path program 1 times [2022-01-10 10:03:07,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:07,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005774272] [2022-01-10 10:03:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:07,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-01-10 10:03:07,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:07,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005774272] [2022-01-10 10:03:07,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005774272] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:03:07,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647432399] [2022-01-10 10:03:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:07,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:03:07,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:03:07,819 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 10:03:07,820 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 10:03:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:08,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 2253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 10:03:08,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:03:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-01-10 10:03:08,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 10:03:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2022-01-10 10:03:09,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647432399] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 10:03:09,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 10:03:09,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 10:03:09,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128827278] [2022-01-10 10:03:09,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 10:03:09,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 10:03:09,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 10:03:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 10:03:09,448 INFO L87 Difference]: Start difference. First operand 3389 states and 4217 transitions. Second operand has 7 states, 7 states have (on average 44.142857142857146) internal successors, (309), 7 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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 10:03:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:09,703 INFO L93 Difference]: Finished difference Result 4238 states and 5270 transitions. [2022-01-10 10:03:09,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 10:03:09,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 44.142857142857146) internal successors, (309), 7 states have internal predecessors, (309), 0 states have call successors, (0), 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 604 [2022-01-10 10:03:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:09,704 INFO L225 Difference]: With dead ends: 4238 [2022-01-10 10:03:09,704 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 10:03:09,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 1207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 10:03:09,706 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 111 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:09,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 466 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 10:03:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 10:03:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 10:03:09,708 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 10:03:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 10:03:09,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2022-01-10 10:03:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:09,708 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 10:03:09,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 44.142857142857146) internal successors, (309), 7 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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 10:03:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 10:03:09,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 10:03:09,711 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 10:03:09,734 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 10:03:09,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-10 10:03:09,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 10:03:14,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 10:03:14,097 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L89-2(lines 86 94) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L89(lines 89 93) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 104) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 101) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 72 620) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L861 garLoopResultBuilder]: At program point L608(lines 105 609) the Hoare annotation is: true [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L612(lines 612 616) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 576) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L612-2(lines 612 616) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L854 garLoopResultBuilder]: At program point L110(lines 109 576) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 10:03:14,098 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 575) no Hoare annotation was computed. [2022-01-10 10:03:14,098 INFO L861 garLoopResultBuilder]: At program point L619(lines 19 621) the Hoare annotation is: true [2022-01-10 10:03:14,098 INFO L854 garLoopResultBuilder]: At program point L215(lines 112 575) the Hoare annotation is: (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 574) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L861 garLoopResultBuilder]: At program point L630(lines 622 632) the Hoare annotation is: true [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 573) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L220-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 572) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 249) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 571) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 239) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L232-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L854 garLoopResultBuilder]: At program point L128(lines 124 571) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 570) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L240(lines 240 245) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 261) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 274) no Hoare annotation was computed. [2022-01-10 10:03:14,099 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 569) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L854 garLoopResultBuilder]: At program point L541(lines 106 607) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (let ((.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse5 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse6 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (.cse12 (= 4496 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse2 (= 4448 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse14 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse11 (not .cse0)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|)) (.cse3 (= 4528 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse9 (= 4512 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse17 (= 4480 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse16 (= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse18 (= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 3)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse5 .cse1 .cse6) (and .cse7 (= 4416 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse0) (and .cse8 .cse9 .cse10) (and .cse7 .cse0 (= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse4 .cse5 .cse8 .cse11 .cse10) (and .cse0 .cse1 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse6) (and .cse7 .cse0 .cse12) (and .cse1 .cse15) (and .cse7 .cse0 .cse2) (and .cse16 .cse0 .cse10) (and .cse13 .cse8 .cse14 .cse11 .cse10) (and .cse7 .cse17 .cse0) (and .cse0 .cse1 .cse9) (and (= 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse10) (and .cse7 .cse0 .cse3) (and .cse18 .cse0 .cse1) (and .cse8 .cse3 .cse10) (and .cse7 .cse0 .cse9) (and .cse17 .cse0 .cse1) (and .cse7 .cse16 .cse0 .cse1) (and .cse7 .cse18 .cse0) (and .cse0 .cse15 .cse10)))) [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L270-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L854 garLoopResultBuilder]: At program point L134(lines 130 569) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 568) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L578(lines 578 602) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L577(lines 577 605) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 567) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L579(lines 579 588) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L294-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 298) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L854 garLoopResultBuilder]: At program point L140(lines 136 567) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)))) [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 566) no Hoare annotation was computed. [2022-01-10 10:03:14,100 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L579-2(lines 578 600) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L305(lines 305 309) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L314-1(lines 314 328) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L318(lines 318 322) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 565) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 596) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L305-2(lines 305 309) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L318-2(lines 316 328) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L854 garLoopResultBuilder]: At program point L146(lines 142 565) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (< 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 564) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 563) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L335-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L854 garLoopResultBuilder]: At program point L152(lines 148 563) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 562) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 352) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 561) no Hoare annotation was computed. [2022-01-10 10:03:14,101 INFO L854 garLoopResultBuilder]: At program point L358(lines 72 620) the Hoare annotation is: false [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L854 garLoopResultBuilder]: At program point L158(lines 154 561) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 560) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 559) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L854 garLoopResultBuilder]: At program point L170(lines 160 559) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 558) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L378-2(lines 378 382) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 557) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 556) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 555) no Hoare annotation was computed. [2022-01-10 10:03:14,102 INFO L854 garLoopResultBuilder]: At program point L176(lines 172 555) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:03:14,102 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 554) no Hoare annotation was computed. [2022-01-10 10:03:14,103 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 405) no Hoare annotation was computed. [2022-01-10 10:03:14,103 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 553) no Hoare annotation was computed. [2022-01-10 10:03:14,103 INFO L858 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-01-10 10:03:14,103 INFO L854 garLoopResultBuilder]: At program point L182(lines 178 553) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:03:14,103 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 552) no Hoare annotation was computed. [2022-01-10 10:03:14,103 INFO L858 garLoopResultBuilder]: For program point L407-2(lines 407 412) no Hoare annotation was computed. [2022-01-10 10:03:14,103 INFO L858 garLoopResultBuilder]: For program point L418(lines 418 422) no Hoare annotation was computed. [2022-01-10 10:03:14,103 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 551) no Hoare annotation was computed. [2022-01-10 10:03:14,104 INFO L854 garLoopResultBuilder]: At program point L188(lines 184 551) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 10:03:14,104 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 550) no Hoare annotation was computed. [2022-01-10 10:03:14,104 INFO L858 garLoopResultBuilder]: For program point L430(lines 430 434) no Hoare annotation was computed. [2022-01-10 10:03:14,104 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 549) no Hoare annotation was computed. [2022-01-10 10:03:14,104 INFO L858 garLoopResultBuilder]: For program point L438(lines 438 442) no Hoare annotation was computed. [2022-01-10 10:03:14,104 INFO L854 garLoopResultBuilder]: At program point L194(lines 190 549) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1) (and .cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 548) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L438-2(lines 210 540) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L459(lines 459 463) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 547) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 454) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 477) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L854 garLoopResultBuilder]: At program point L200(lines 196 547) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 12292) .cse0) (and .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse0 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) .cse0 (not .cse1) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 546) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 474) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L466-1(lines 466 477) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L483(lines 483 487) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 545) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L854 garLoopResultBuilder]: At program point L203(lines 202 545) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse1 .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int|) (not .cse0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse1 .cse2))) [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 544) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L488-2(lines 488 492) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 504) no Hoare annotation was computed. [2022-01-10 10:03:14,105 INFO L858 garLoopResultBuilder]: For program point L496-1(lines 496 508) no Hoare annotation was computed. [2022-01-10 10:03:14,106 INFO L861 garLoopResultBuilder]: At program point L206(lines 205 544) the Hoare annotation is: true [2022-01-10 10:03:14,106 INFO L861 garLoopResultBuilder]: At program point L209(lines 208 543) the Hoare annotation is: true [2022-01-10 10:03:14,106 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 210 540) no Hoare annotation was computed. [2022-01-10 10:03:14,106 INFO L858 garLoopResultBuilder]: For program point L517-1(lines 517 521) no Hoare annotation was computed. [2022-01-10 10:03:14,106 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 528) no Hoare annotation was computed. [2022-01-10 10:03:14,106 INFO L858 garLoopResultBuilder]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2022-01-10 10:03:14,106 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-01-10 10:03:14,108 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:14,109 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 10:03:14,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:03:14 BasicIcfg [2022-01-10 10:03:14,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 10:03:14,148 INFO L158 Benchmark]: Toolchain (without parser) took 50270.25ms. Allocated memory was 179.3MB in the beginning and 431.0MB in the end (delta: 251.7MB). Free memory was 129.5MB in the beginning and 175.1MB in the end (delta: -45.6MB). Peak memory consumption was 280.6MB. Max. memory is 8.0GB. [2022-01-10 10:03:14,148 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 75.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 10:03:14,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.32ms. Allocated memory is still 179.3MB. Free memory was 129.3MB in the beginning and 152.8MB in the end (delta: -23.5MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-01-10 10:03:14,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.45ms. Allocated memory is still 179.3MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 10:03:14,148 INFO L158 Benchmark]: Boogie Preprocessor took 20.39ms. Allocated memory is still 179.3MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 10:03:14,148 INFO L158 Benchmark]: RCFGBuilder took 548.61ms. Allocated memory is still 179.3MB. Free memory was 148.1MB in the beginning and 124.5MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-01-10 10:03:14,149 INFO L158 Benchmark]: IcfgTransformer took 158.23ms. Allocated memory is still 179.3MB. Free memory was 124.5MB in the beginning and 106.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 10:03:14,149 INFO L158 Benchmark]: TraceAbstraction took 49174.10ms. Allocated memory was 179.3MB in the beginning and 431.0MB in the end (delta: 251.7MB). Free memory was 106.2MB in the beginning and 175.1MB in the end (delta: -68.9MB). Peak memory consumption was 256.8MB. Max. memory is 8.0GB. [2022-01-10 10:03:14,149 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.09ms. Allocated memory is still 179.3MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 75.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.32ms. Allocated memory is still 179.3MB. Free memory was 129.3MB in the beginning and 152.8MB in the end (delta: -23.5MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.45ms. Allocated memory is still 179.3MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.39ms. Allocated memory is still 179.3MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 548.61ms. Allocated memory is still 179.3MB. Free memory was 148.1MB in the beginning and 124.5MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * IcfgTransformer took 158.23ms. Allocated memory is still 179.3MB. Free memory was 124.5MB in the beginning and 106.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 49174.10ms. Allocated memory was 179.3MB in the beginning and 431.0MB in the end (delta: 251.7MB). Free memory was 106.2MB in the beginning and 175.1MB in the end (delta: -68.9MB). Peak memory consumption was 256.8MB. 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: 618]: 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, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.1s, OverallIterations: 26, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 2249 SdHoareTripleChecker+Valid, 31.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 8002 SdHoareTripleChecker+Invalid, 30.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2992 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2957 IncrementalHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 5010 mSDtfsCounter, 2957 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3564 GetRequests, 3519 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8118occurred in iteration=21, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 6244 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 256 NumberOfFragments, 745 HoareAnnotationTreeSize, 22 FomulaSimplifications, 14888 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 11217 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 8422 NumberOfCodeBlocks, 8422 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 9704 ConstructedInterpolants, 0 QuantifiedInterpolants, 15370 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8445 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 42879/42991 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: 109]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && ~bvule32(4560bv32, s__state) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(4560bv32, s__state)) && ~bvult64(s__state, 12292bv32)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4384bv32, s__state)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4384bv32, s__state)) && ~bvule32(blastFlag, 4bv32))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4384bv32, s__state)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32)) || ((blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && ~bvule32(s__state, 4352bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32)) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && s__state == 4400bv32) || blastFlag == 0bv32) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && s__state == 4400bv32)) || ((0bv32 == s__hit && 4512bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4512bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32))) || (~bvule32(blastFlag, 2bv32) && s__state == 4384bv32)) || ((s__state == 4448bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4480bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(0bv32, s__hit)) && 4528bv32 == s__state)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && s__state == 4448bv32) && 0bv32 == s__hit)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && s__state == 4496bv32)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4512bv32 == s__state)) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4432bv32 == s__state)) || (~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 3bv32))) || ((s__state == 4416bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || (((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(4352bv32, s__state)) && ~bvule32(0bv32, s__hit)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32))) || ((0bv32 == s__hit && s__state == 4496bv32) && ~bvule32(blastFlag, 4bv32))) || ((0bv32 == s__hit && 4480bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && ~bvule32(s__state, 3bv32))) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4464bv32 == s__state)) || ((0bv32 == s__hit && 4528bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4464bv32 == s__state)) || ((((!(0bv32 == s__hit) && ~bvule32(blastFlag, 2bv32)) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4528bv32 == s__state) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state)) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(0bv32, s__hit)) && ~bvule32(4432bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 10:03:14,181 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...