/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:18:20,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:18:20,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:18:20,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:18:20,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:18:20,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:18:20,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:18:20,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:18:20,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:18:20,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:18:20,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:18:20,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:18:20,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:18:20,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:18:20,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:18:20,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:18:20,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:18:20,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:18:20,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:18:20,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:18:20,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:18:20,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:18:20,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:18:20,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:18:20,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:18:20,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:18:20,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:18:20,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:18:20,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:18:20,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:18:20,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:18:20,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:18:20,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:18:20,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:18:20,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:18:20,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:18:20,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:18:20,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:18:20,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:18:20,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:18:20,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:18:20,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 14:18:20,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:18:20,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:18:20,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:18:20,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:18:20,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:18:20,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:18:20,183 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:18:20,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:18:20,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:18:20,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:18:20,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:18:20,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:20,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:18:20,185 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:18:20,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:18:20,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:18:20,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:18:20,186 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:18:20,187 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 14:18:20,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:18:20,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:18:20,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:18:20,390 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:18:20,390 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:18:20,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2022-01-10 14:18:20,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f621dea6/f650789d10fb49a6b91145301f0b5f29/FLAGa5ad10617 [2022-01-10 14:18:20,843 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:18:20,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2022-01-10 14:18:20,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f621dea6/f650789d10fb49a6b91145301f0b5f29/FLAGa5ad10617 [2022-01-10 14:18:20,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f621dea6/f650789d10fb49a6b91145301f0b5f29 [2022-01-10 14:18:20,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:18:20,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:18:20,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:20,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:18:20,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:18:20,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:20" (1/1) ... [2022-01-10 14:18:20,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1f6ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:20, skipping insertion in model container [2022-01-10 14:18:20,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:20" (1/1) ... [2022-01-10 14:18:20,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:18:20,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:18:21,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-01-10 14:18:21,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:21,136 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:18:21,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-01-10 14:18:21,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:21,195 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:18:21,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21 WrapperNode [2022-01-10 14:18:21,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:21,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:21,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:18:21,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:18:21,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,248 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 481 [2022-01-10 14:18:21,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:21,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:18:21,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:18:21,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:18:21,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:18:21,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:18:21,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:18:21,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:18:21,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:21,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:18:21,302 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 14:18:21,307 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 14:18:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:18:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:18:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:18:21,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:18:21,422 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:18:21,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:18:21,433 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 14:18:21,816 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 14:18:21,816 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 14:18:21,816 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:18:21,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:18:21,824 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 14:18:21,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:21 BoogieIcfgContainer [2022-01-10 14:18:21,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:18:21,826 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:18:21,826 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:18:21,827 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:18:21,829 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:21" (1/1) ... [2022-01-10 14:18:21,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:21 BasicIcfg [2022-01-10 14:18:21,986 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:18:21,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:18:21,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:18:21,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:18:21,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:18:20" (1/4) ... [2022-01-10 14:18:21,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e05f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:21, skipping insertion in model container [2022-01-10 14:18:21,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:21" (2/4) ... [2022-01-10 14:18:21,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e05f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:21, skipping insertion in model container [2022-01-10 14:18:21,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:21" (3/4) ... [2022-01-10 14:18:21,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e05f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:21, skipping insertion in model container [2022-01-10 14:18:21,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:21" (4/4) ... [2022-01-10 14:18:21,992 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.cTransformedIcfg [2022-01-10 14:18:21,997 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:18:21,997 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 14:18:22,034 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:18:22,045 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 14:18:22,045 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 14:18:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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 14:18:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:18:22,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:22,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:22,071 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash -956265968, now seen corresponding path program 1 times [2022-01-10 14:18:22,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151754010] [2022-01-10 14:18:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:22,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:22,314 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 14:18:22,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:22,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151754010] [2022-01-10 14:18:22,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151754010] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:22,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:22,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:22,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612200219] [2022-01-10 14:18:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:22,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:22,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:22,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:22,350 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:22,446 INFO L93 Difference]: Finished difference Result 401 states and 687 transitions. [2022-01-10 14:18:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:18:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:22,459 INFO L225 Difference]: With dead ends: 401 [2022-01-10 14:18:22,460 INFO L226 Difference]: Without dead ends: 241 [2022-01-10 14:18:22,463 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 14:18:22,468 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 184 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 442 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 14:18:22,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 442 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-01-10 14:18:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-01-10 14:18:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.5416666666666667) internal successors, (370), 240 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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 14:18:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 370 transitions. [2022-01-10 14:18:22,518 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 370 transitions. Word has length 44 [2022-01-10 14:18:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:22,519 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 370 transitions. [2022-01-10 14:18:22,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 370 transitions. [2022-01-10 14:18:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 14:18:22,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:22,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:22,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:18:22,525 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash -586427778, now seen corresponding path program 1 times [2022-01-10 14:18:22,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:22,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174535460] [2022-01-10 14:18:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:22,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:18:22,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:22,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174535460] [2022-01-10 14:18:22,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174535460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:22,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:22,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:22,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019934799] [2022-01-10 14:18:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:22,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:22,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:22,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:22,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:22,589 INFO L87 Difference]: Start difference. First operand 241 states and 370 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:22,714 INFO L93 Difference]: Finished difference Result 388 states and 602 transitions. [2022-01-10 14:18:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:22,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-10 14:18:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:22,716 INFO L225 Difference]: With dead ends: 388 [2022-01-10 14:18:22,717 INFO L226 Difference]: Without dead ends: 270 [2022-01-10 14:18:22,722 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 14:18:22,723 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:22,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 306 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-01-10 14:18:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2022-01-10 14:18:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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 14:18:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 396 transitions. [2022-01-10 14:18:22,753 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 396 transitions. Word has length 60 [2022-01-10 14:18:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:22,753 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 396 transitions. [2022-01-10 14:18:22,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 396 transitions. [2022-01-10 14:18:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 14:18:22,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:22,756 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:22,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:18:22,756 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1572470231, now seen corresponding path program 1 times [2022-01-10 14:18:22,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:22,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464247412] [2022-01-10 14:18:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:22,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 14:18:22,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464247412] [2022-01-10 14:18:22,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464247412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:22,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:22,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:22,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38145132] [2022-01-10 14:18:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:22,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:22,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:22,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:22,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:22,855 INFO L87 Difference]: Start difference. First operand 262 states and 396 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:23,028 INFO L93 Difference]: Finished difference Result 608 states and 945 transitions. [2022-01-10 14:18:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:23,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-01-10 14:18:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:23,032 INFO L225 Difference]: With dead ends: 608 [2022-01-10 14:18:23,032 INFO L226 Difference]: Without dead ends: 354 [2022-01-10 14:18:23,034 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 14:18:23,038 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:23,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 307 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:18:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-01-10 14:18:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 346. [2022-01-10 14:18:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.4202898550724639) internal successors, (490), 345 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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 14:18:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 490 transitions. [2022-01-10 14:18:23,055 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 490 transitions. Word has length 81 [2022-01-10 14:18:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:23,056 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 490 transitions. [2022-01-10 14:18:23,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 490 transitions. [2022-01-10 14:18:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 14:18:23,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:23,060 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:23,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:18:23,060 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1696543478, now seen corresponding path program 1 times [2022-01-10 14:18:23,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:23,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520733164] [2022-01-10 14:18:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:23,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 14:18:23,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:23,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520733164] [2022-01-10 14:18:23,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520733164] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:23,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:23,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:23,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353779668] [2022-01-10 14:18:23,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:23,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:23,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:23,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:23,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:23,104 INFO L87 Difference]: Start difference. First operand 346 states and 490 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:23,196 INFO L93 Difference]: Finished difference Result 736 states and 1060 transitions. [2022-01-10 14:18:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:23,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-01-10 14:18:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:23,201 INFO L225 Difference]: With dead ends: 736 [2022-01-10 14:18:23,201 INFO L226 Difference]: Without dead ends: 398 [2022-01-10 14:18:23,201 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 14:18:23,202 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:23,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 307 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-01-10 14:18:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 392. [2022-01-10 14:18:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.3964194373401535) internal successors, (546), 391 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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 14:18:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 546 transitions. [2022-01-10 14:18:23,209 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 546 transitions. Word has length 81 [2022-01-10 14:18:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:23,210 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 546 transitions. [2022-01-10 14:18:23,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 546 transitions. [2022-01-10 14:18:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 14:18:23,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:23,211 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:23,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:18:23,211 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 495869645, now seen corresponding path program 1 times [2022-01-10 14:18:23,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:23,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902103478] [2022-01-10 14:18:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:23,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 14:18:23,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:23,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902103478] [2022-01-10 14:18:23,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902103478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:23,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:23,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:23,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352027852] [2022-01-10 14:18:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:23,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:23,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:23,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:23,269 INFO L87 Difference]: Start difference. First operand 392 states and 546 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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 14:18:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:23,375 INFO L93 Difference]: Finished difference Result 850 states and 1212 transitions. [2022-01-10 14:18:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 101 [2022-01-10 14:18:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:23,377 INFO L225 Difference]: With dead ends: 850 [2022-01-10 14:18:23,377 INFO L226 Difference]: Without dead ends: 466 [2022-01-10 14:18:23,378 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 14:18:23,378 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 28 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:23,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 306 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-01-10 14:18:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 442. [2022-01-10 14:18:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.3741496598639455) internal successors, (606), 441 states have internal predecessors, (606), 0 states have call successors, (0), 0 states 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 14:18:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 606 transitions. [2022-01-10 14:18:23,386 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 606 transitions. Word has length 101 [2022-01-10 14:18:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:23,386 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 606 transitions. [2022-01-10 14:18:23,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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 14:18:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 606 transitions. [2022-01-10 14:18:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:18:23,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:23,388 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:23,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:18:23,388 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash -194084923, now seen corresponding path program 1 times [2022-01-10 14:18:23,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:23,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375638356] [2022-01-10 14:18:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:23,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 14:18:23,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:23,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375638356] [2022-01-10 14:18:23,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375638356] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:23,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:23,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:23,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929704730] [2022-01-10 14:18:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:23,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:23,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:23,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:23,429 INFO L87 Difference]: Start difference. First operand 442 states and 606 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 14:18:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:23,466 INFO L93 Difference]: Finished difference Result 671 states and 920 transitions. [2022-01-10 14:18:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:23,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-10 14:18:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:23,468 INFO L225 Difference]: With dead ends: 671 [2022-01-10 14:18:23,469 INFO L226 Difference]: Without dead ends: 669 [2022-01-10 14:18:23,469 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 14:18:23,469 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 146 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:23,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 357 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-01-10 14:18:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-01-10 14:18:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.372754491017964) internal successors, (917), 668 states have internal predecessors, (917), 0 states have call successors, (0), 0 states 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 14:18:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 917 transitions. [2022-01-10 14:18:23,480 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 917 transitions. Word has length 121 [2022-01-10 14:18:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:23,480 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 917 transitions. [2022-01-10 14:18:23,481 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 14:18:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 917 transitions. [2022-01-10 14:18:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 14:18:23,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:23,482 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:23,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:18:23,483 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash -451237969, now seen corresponding path program 1 times [2022-01-10 14:18:23,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:23,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644426026] [2022-01-10 14:18:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:23,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 14:18:23,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:23,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644426026] [2022-01-10 14:18:23,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644426026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:23,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:23,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:23,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528461132] [2022-01-10 14:18:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:23,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:23,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:23,523 INFO L87 Difference]: Start difference. First operand 669 states and 917 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 14:18:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:23,646 INFO L93 Difference]: Finished difference Result 1486 states and 2101 transitions. [2022-01-10 14:18:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:23,646 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 159 [2022-01-10 14:18:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:23,648 INFO L225 Difference]: With dead ends: 1486 [2022-01-10 14:18:23,648 INFO L226 Difference]: Without dead ends: 825 [2022-01-10 14:18:23,649 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 14:18:23,651 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:23,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 296 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-01-10 14:18:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 792. [2022-01-10 14:18:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.345132743362832) internal successors, (1064), 791 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 14:18:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1064 transitions. [2022-01-10 14:18:23,665 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1064 transitions. Word has length 159 [2022-01-10 14:18:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:23,665 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1064 transitions. [2022-01-10 14:18:23,665 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 14:18:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1064 transitions. [2022-01-10 14:18:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 14:18:23,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:23,667 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:23,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:18:23,667 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash 663151586, now seen corresponding path program 1 times [2022-01-10 14:18:23,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:23,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104949814] [2022-01-10 14:18:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:23,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-01-10 14:18:23,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:23,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104949814] [2022-01-10 14:18:23,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104949814] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:23,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:23,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:23,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277254221] [2022-01-10 14:18:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:23,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:23,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:23,732 INFO L87 Difference]: Start difference. First operand 792 states and 1064 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 14:18:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:23,831 INFO L93 Difference]: Finished difference Result 1678 states and 2302 transitions. [2022-01-10 14:18:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 165 [2022-01-10 14:18:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:23,834 INFO L225 Difference]: With dead ends: 1678 [2022-01-10 14:18:23,834 INFO L226 Difference]: Without dead ends: 894 [2022-01-10 14:18:23,834 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 14:18:23,835 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:23,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 306 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-01-10 14:18:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 873. [2022-01-10 14:18:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.3302752293577982) internal successors, (1160), 872 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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 14:18:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1160 transitions. [2022-01-10 14:18:23,852 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1160 transitions. Word has length 165 [2022-01-10 14:18:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:23,852 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1160 transitions. [2022-01-10 14:18:23,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 14:18:23,852 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1160 transitions. [2022-01-10 14:18:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-10 14:18:23,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:23,855 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:23,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:18:23,855 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1517385311, now seen corresponding path program 1 times [2022-01-10 14:18:23,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:23,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454532594] [2022-01-10 14:18:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:23,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 14:18:23,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:23,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454532594] [2022-01-10 14:18:23,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454532594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:23,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:23,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:23,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282627821] [2022-01-10 14:18:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:23,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:23,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:23,907 INFO L87 Difference]: Start difference. First operand 873 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:24,033 INFO L93 Difference]: Finished difference Result 1908 states and 2602 transitions. [2022-01-10 14:18:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-01-10 14:18:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:24,036 INFO L225 Difference]: With dead ends: 1908 [2022-01-10 14:18:24,036 INFO L226 Difference]: Without dead ends: 1040 [2022-01-10 14:18:24,037 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 14:18:24,038 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:24,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2022-01-10 14:18:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1023. [2022-01-10 14:18:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 1.3786692759295498) internal successors, (1409), 1022 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states 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 14:18:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1409 transitions. [2022-01-10 14:18:24,054 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1409 transitions. Word has length 172 [2022-01-10 14:18:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:24,055 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1409 transitions. [2022-01-10 14:18:24,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1409 transitions. [2022-01-10 14:18:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-10 14:18:24,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:24,057 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:24,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 14:18:24,057 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash 729098443, now seen corresponding path program 1 times [2022-01-10 14:18:24,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:24,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381728599] [2022-01-10 14:18:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:24,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-01-10 14:18:24,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:24,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381728599] [2022-01-10 14:18:24,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381728599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:24,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:24,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:24,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871346286] [2022-01-10 14:18:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:24,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:24,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:24,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:24,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:24,118 INFO L87 Difference]: Start difference. First operand 1023 states and 1409 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 14:18:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:24,221 INFO L93 Difference]: Finished difference Result 2131 states and 2965 transitions. [2022-01-10 14:18:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:24,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 188 [2022-01-10 14:18:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:24,224 INFO L225 Difference]: With dead ends: 2131 [2022-01-10 14:18:24,225 INFO L226 Difference]: Without dead ends: 1116 [2022-01-10 14:18:24,226 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 14:18:24,226 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:24,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 306 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-01-10 14:18:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1110. [2022-01-10 14:18:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.3624887285843101) internal successors, (1511), 1109 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states 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 14:18:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1511 transitions. [2022-01-10 14:18:24,244 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1511 transitions. Word has length 188 [2022-01-10 14:18:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:24,244 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1511 transitions. [2022-01-10 14:18:24,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 14:18:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1511 transitions. [2022-01-10 14:18:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-01-10 14:18:24,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:24,246 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:24,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:18:24,246 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash -474677764, now seen corresponding path program 1 times [2022-01-10 14:18:24,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:24,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073210414] [2022-01-10 14:18:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:24,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-01-10 14:18:24,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073210414] [2022-01-10 14:18:24,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073210414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:24,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:24,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:24,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814983124] [2022-01-10 14:18:24,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:24,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:24,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:24,299 INFO L87 Difference]: Start difference. First operand 1110 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:24,356 INFO L93 Difference]: Finished difference Result 3308 states and 4500 transitions. [2022-01-10 14:18:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:24,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2022-01-10 14:18:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:24,362 INFO L225 Difference]: With dead ends: 3308 [2022-01-10 14:18:24,362 INFO L226 Difference]: Without dead ends: 2206 [2022-01-10 14:18:24,363 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 14:18:24,363 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 146 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:24,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 556 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2022-01-10 14:18:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2204. [2022-01-10 14:18:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 2203 states have (on average 1.3590558329550613) internal successors, (2994), 2203 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states 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 14:18:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2994 transitions. [2022-01-10 14:18:24,405 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2994 transitions. Word has length 192 [2022-01-10 14:18:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:24,405 INFO L470 AbstractCegarLoop]: Abstraction has 2204 states and 2994 transitions. [2022-01-10 14:18:24,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2994 transitions. [2022-01-10 14:18:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-01-10 14:18:24,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:24,409 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:24,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:18:24,409 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash 386658770, now seen corresponding path program 1 times [2022-01-10 14:18:24,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:24,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607150623] [2022-01-10 14:18:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:24,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-01-10 14:18:24,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:24,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607150623] [2022-01-10 14:18:24,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607150623] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:24,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:24,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:24,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040440292] [2022-01-10 14:18:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:24,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:24,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:24,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:24,460 INFO L87 Difference]: Start difference. First operand 2204 states and 2994 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 14:18:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:24,589 INFO L93 Difference]: Finished difference Result 4586 states and 6306 transitions. [2022-01-10 14:18:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 193 [2022-01-10 14:18:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:24,596 INFO L225 Difference]: With dead ends: 4586 [2022-01-10 14:18:24,596 INFO L226 Difference]: Without dead ends: 2390 [2022-01-10 14:18:24,599 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 14:18:24,600 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:24,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 287 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2022-01-10 14:18:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2022-01-10 14:18:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2389 states have (on average 1.343658434491419) internal successors, (3210), 2389 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states 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 14:18:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3210 transitions. [2022-01-10 14:18:24,653 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3210 transitions. Word has length 193 [2022-01-10 14:18:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:24,654 INFO L470 AbstractCegarLoop]: Abstraction has 2390 states and 3210 transitions. [2022-01-10 14:18:24,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 14:18:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3210 transitions. [2022-01-10 14:18:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-01-10 14:18:24,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:24,658 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:24,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:18:24,658 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1187666133, now seen corresponding path program 1 times [2022-01-10 14:18:24,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:24,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828885679] [2022-01-10 14:18:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:24,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 320 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 14:18:24,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:24,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828885679] [2022-01-10 14:18:24,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828885679] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:18:24,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852119330] [2022-01-10 14:18:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:24,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:18:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:18:24,732 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 14:18:24,755 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 14:18:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:24,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 14:18:24,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:18:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-01-10 14:18:25,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 14:18:25,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852119330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:25,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 14:18:25,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 14:18:25,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123122498] [2022-01-10 14:18:25,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:25,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:25,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:25,323 INFO L87 Difference]: Start difference. First operand 2390 states and 3210 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:25,379 INFO L93 Difference]: Finished difference Result 4816 states and 6470 transitions. [2022-01-10 14:18:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:25,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2022-01-10 14:18:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:25,388 INFO L225 Difference]: With dead ends: 4816 [2022-01-10 14:18:25,388 INFO L226 Difference]: Without dead ends: 3198 [2022-01-10 14:18:25,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 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 14:18:25,391 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 128 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:25,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 358 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2022-01-10 14:18:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3198. [2022-01-10 14:18:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3198 states, 3197 states have (on average 1.3428213950578667) internal successors, (4293), 3197 states have internal predecessors, (4293), 0 states have call successors, (0), 0 states 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 14:18:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4293 transitions. [2022-01-10 14:18:25,456 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4293 transitions. Word has length 222 [2022-01-10 14:18:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:25,456 INFO L470 AbstractCegarLoop]: Abstraction has 3198 states and 4293 transitions. [2022-01-10 14:18:25,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4293 transitions. [2022-01-10 14:18:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-01-10 14:18:25,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:25,461 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:25,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 14:18:25,668 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,SelfDestructingSolverStorable12 [2022-01-10 14:18:25,669 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash -225716661, now seen corresponding path program 1 times [2022-01-10 14:18:25,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:25,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393082110] [2022-01-10 14:18:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:25,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-01-10 14:18:25,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:25,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393082110] [2022-01-10 14:18:25,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393082110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:25,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:25,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:25,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759538584] [2022-01-10 14:18:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:25,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:25,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:25,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:25,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:25,728 INFO L87 Difference]: Start difference. First operand 3198 states and 4293 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:25,895 INFO L93 Difference]: Finished difference Result 6724 states and 9182 transitions. [2022-01-10 14:18:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:25,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2022-01-10 14:18:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:25,904 INFO L225 Difference]: With dead ends: 6724 [2022-01-10 14:18:25,904 INFO L226 Difference]: Without dead ends: 3182 [2022-01-10 14:18:25,908 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 14:18:25,909 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:25,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 306 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2022-01-10 14:18:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3182. [2022-01-10 14:18:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.3370009430996541) internal successors, (4253), 3181 states have internal predecessors, (4253), 0 states have call successors, (0), 0 states 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 14:18:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4253 transitions. [2022-01-10 14:18:25,989 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4253 transitions. Word has length 231 [2022-01-10 14:18:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:25,989 INFO L470 AbstractCegarLoop]: Abstraction has 3182 states and 4253 transitions. [2022-01-10 14:18:25,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4253 transitions. [2022-01-10 14:18:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-01-10 14:18:25,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:25,995 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:25,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:18:25,996 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1794200295, now seen corresponding path program 1 times [2022-01-10 14:18:25,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:25,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888781664] [2022-01-10 14:18:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:25,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-01-10 14:18:26,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:26,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888781664] [2022-01-10 14:18:26,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888781664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:26,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:26,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:26,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825674819] [2022-01-10 14:18:26,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:26,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:26,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:26,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:26,064 INFO L87 Difference]: Start difference. First operand 3182 states and 4253 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 14:18:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:26,149 INFO L93 Difference]: Finished difference Result 9322 states and 12487 transitions. [2022-01-10 14:18:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:26,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 271 [2022-01-10 14:18:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:26,158 INFO L225 Difference]: With dead ends: 9322 [2022-01-10 14:18:26,158 INFO L226 Difference]: Without dead ends: 3922 [2022-01-10 14:18:26,164 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 14:18:26,165 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 117 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:26,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 548 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2022-01-10 14:18:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3920. [2022-01-10 14:18:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.3329931104873691) internal successors, (5224), 3919 states have internal predecessors, (5224), 0 states have call successors, (0), 0 states 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 14:18:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5224 transitions. [2022-01-10 14:18:26,243 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5224 transitions. Word has length 271 [2022-01-10 14:18:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:26,244 INFO L470 AbstractCegarLoop]: Abstraction has 3920 states and 5224 transitions. [2022-01-10 14:18:26,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 14:18:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5224 transitions. [2022-01-10 14:18:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-01-10 14:18:26,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:26,249 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:26,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:18:26,249 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2005870382, now seen corresponding path program 1 times [2022-01-10 14:18:26,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:26,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3901922] [2022-01-10 14:18:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:26,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-10 14:18:26,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:26,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3901922] [2022-01-10 14:18:26,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3901922] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:18:26,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386536281] [2022-01-10 14:18:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:26,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:18:26,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:18:26,327 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 14:18:26,328 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 14:18:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:26,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 14:18:26,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:18:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-10 14:18:26,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:18:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-10 14:18:27,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386536281] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:18:27,508 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:18:27,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 14:18:27,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650494585] [2022-01-10 14:18:27,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:18:27,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:27,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:27,510 INFO L87 Difference]: Start difference. First operand 3920 states and 5224 transitions. Second operand has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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 14:18:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:27,994 INFO L93 Difference]: Finished difference Result 9789 states and 13248 transitions. [2022-01-10 14:18:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 14:18:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 374 [2022-01-10 14:18:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:28,018 INFO L225 Difference]: With dead ends: 9789 [2022-01-10 14:18:28,019 INFO L226 Difference]: Without dead ends: 5578 [2022-01-10 14:18:28,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:28,023 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 498 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:28,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 704 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 14:18:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2022-01-10 14:18:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4080. [2022-01-10 14:18:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4080 states, 4079 states have (on average 1.3248345182642804) internal successors, (5404), 4079 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states 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 14:18:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 5404 transitions. [2022-01-10 14:18:28,119 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 5404 transitions. Word has length 374 [2022-01-10 14:18:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:28,120 INFO L470 AbstractCegarLoop]: Abstraction has 4080 states and 5404 transitions. [2022-01-10 14:18:28,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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 14:18:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 5404 transitions. [2022-01-10 14:18:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2022-01-10 14:18:28,127 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:28,127 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:28,147 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 14:18:28,339 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,SelfDestructingSolverStorable15 [2022-01-10 14:18:28,339 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash 915458480, now seen corresponding path program 1 times [2022-01-10 14:18:28,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:28,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174132120] [2022-01-10 14:18:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:28,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-01-10 14:18:28,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:28,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174132120] [2022-01-10 14:18:28,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174132120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:28,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:28,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:28,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083676318] [2022-01-10 14:18:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:28,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:28,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:28,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:28,455 INFO L87 Difference]: Start difference. First operand 4080 states and 5404 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:28,614 INFO L93 Difference]: Finished difference Result 8620 states and 11602 transitions. [2022-01-10 14:18:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:28,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 474 [2022-01-10 14:18:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:28,625 INFO L225 Difference]: With dead ends: 8620 [2022-01-10 14:18:28,625 INFO L226 Difference]: Without dead ends: 4548 [2022-01-10 14:18:28,633 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 14:18:28,634 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:28,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 303 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2022-01-10 14:18:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 4522. [2022-01-10 14:18:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4522 states, 4521 states have (on average 1.307454103074541) internal successors, (5911), 4521 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states 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 14:18:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4522 states to 4522 states and 5911 transitions. [2022-01-10 14:18:28,796 INFO L78 Accepts]: Start accepts. Automaton has 4522 states and 5911 transitions. Word has length 474 [2022-01-10 14:18:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:28,796 INFO L470 AbstractCegarLoop]: Abstraction has 4522 states and 5911 transitions. [2022-01-10 14:18:28,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4522 states and 5911 transitions. [2022-01-10 14:18:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2022-01-10 14:18:28,805 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:28,805 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:28,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:18:28,805 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2031328088, now seen corresponding path program 1 times [2022-01-10 14:18:28,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:28,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266898779] [2022-01-10 14:18:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:28,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-01-10 14:18:28,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:28,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266898779] [2022-01-10 14:18:28,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266898779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:28,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:28,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:18:28,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676551263] [2022-01-10 14:18:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:28,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:18:28,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:18:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:18:28,909 INFO L87 Difference]: Start difference. First operand 4522 states and 5911 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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 14:18:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:29,056 INFO L93 Difference]: Finished difference Result 9530 states and 12668 transitions. [2022-01-10 14:18:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:18:29,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 536 [2022-01-10 14:18:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:29,063 INFO L225 Difference]: With dead ends: 9530 [2022-01-10 14:18:29,063 INFO L226 Difference]: Without dead ends: 5016 [2022-01-10 14:18:29,068 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 14:18:29,069 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:29,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 303 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5016 states. [2022-01-10 14:18:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5016 to 4990. [2022-01-10 14:18:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 4989 states have (on average 1.2916416115454) internal successors, (6444), 4989 states have internal predecessors, (6444), 0 states have call successors, (0), 0 states 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 14:18:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 6444 transitions. [2022-01-10 14:18:29,192 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 6444 transitions. Word has length 536 [2022-01-10 14:18:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:29,192 INFO L470 AbstractCegarLoop]: Abstraction has 4990 states and 6444 transitions. [2022-01-10 14:18:29,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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 14:18:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 6444 transitions. [2022-01-10 14:18:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2022-01-10 14:18:29,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:29,200 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:29,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:18:29,200 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:18:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash -589552592, now seen corresponding path program 1 times [2022-01-10 14:18:29,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:29,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209681022] [2022-01-10 14:18:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-10 14:18:29,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:29,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209681022] [2022-01-10 14:18:29,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209681022] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:18:29,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270040336] [2022-01-10 14:18:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:18:29,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:18:29,318 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 14:18:29,319 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 14:18:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:29,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 2275 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 14:18:29,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:18:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-10 14:18:30,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:18:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-10 14:18:30,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270040336] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:18:30,925 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:18:30,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 14:18:30,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57088924] [2022-01-10 14:18:30,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:30,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:30,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:30,927 INFO L87 Difference]: Start difference. First operand 4990 states and 6444 transitions. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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 14:18:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,265 INFO L93 Difference]: Finished difference Result 8477 states and 11055 transitions. [2022-01-10 14:18:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:18:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 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 602 [2022-01-10 14:18:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,266 INFO L225 Difference]: With dead ends: 8477 [2022-01-10 14:18:31,266 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 14:18:31,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1212 GetRequests, 1205 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:18:31,273 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 210 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 749 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 14:18:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 14:18:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 14:18:31,274 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 14:18:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 14:18:31,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 602 [2022-01-10 14:18:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,274 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 14:18:31,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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 14:18:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 14:18:31,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 14:18:31,276 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 14:18:31,297 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 14:18:31,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:18:31,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-01-10 14:18:34,804 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2022-01-10 14:18:34,805 INFO L861 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2022-01-10 14:18:34,805 INFO L854 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 14:18:34,805 INFO L861 garLoopResultBuilder]: At program point L686(lines 20 688) the Hoare annotation is: true [2022-01-10 14:18:34,805 INFO L861 garLoopResultBuilder]: At program point L670(lines 108 671) the Hoare annotation is: true [2022-01-10 14:18:34,805 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 14:18:34,805 INFO L861 garLoopResultBuilder]: At program point L698(lines 689 700) the Hoare annotation is: true [2022-01-10 14:18:34,805 INFO L858 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2022-01-10 14:18:34,805 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2022-01-10 14:18:34,805 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 14:18:34,805 INFO L858 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2022-01-10 14:18:34,805 INFO L854 garLoopResultBuilder]: At program point L113(lines 112 638) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 14:18:34,805 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2022-01-10 14:18:34,805 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 14:18:34,806 INFO L854 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) [2022-01-10 14:18:34,806 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2022-01-10 14:18:34,806 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-01-10 14:18:34,806 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2022-01-10 14:18:34,806 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 14:18:34,806 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2022-01-10 14:18:34,806 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L854 garLoopResultBuilder]: At program point L131(lines 127 633) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2022-01-10 14:18:34,807 INFO L854 garLoopResultBuilder]: At program point L601(lines 109 669) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 14:18:34,807 INFO L854 garLoopResultBuilder]: At program point L134(lines 133 631) the Hoare annotation is: (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) [2022-01-10 14:18:34,808 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2022-01-10 14:18:34,808 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2022-01-10 14:18:34,809 INFO L858 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2022-01-10 14:18:34,809 INFO L858 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2022-01-10 14:18:34,809 INFO L854 garLoopResultBuilder]: At program point L143(lines 136 630) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,809 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2022-01-10 14:18:34,809 INFO L858 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2022-01-10 14:18:34,809 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L854 garLoopResultBuilder]: At program point L149(lines 145 627) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L854 garLoopResultBuilder]: At program point L155(lines 151 625) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2022-01-10 14:18:34,810 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 14:18:34,811 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2022-01-10 14:18:34,811 INFO L858 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2022-01-10 14:18:34,811 INFO L854 garLoopResultBuilder]: At program point L161(lines 157 623) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,811 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2022-01-10 14:18:34,811 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L854 garLoopResultBuilder]: At program point L167(lines 163 621) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L854 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L858 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2022-01-10 14:18:34,812 INFO L854 garLoopResultBuilder]: At program point L404(lines 395 426) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,812 INFO L854 garLoopResultBuilder]: At program point L173(lines 169 619) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L854 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L854 garLoopResultBuilder]: At program point L176(lines 175 617) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse1))) [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L854 garLoopResultBuilder]: At program point L182(lines 178 616) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2022-01-10 14:18:34,813 INFO L854 garLoopResultBuilder]: At program point L188(lines 184 614) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L854 garLoopResultBuilder]: At program point L194(lines 190 612) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L854 garLoopResultBuilder]: At program point L200(lines 196 610) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L854 garLoopResultBuilder]: At program point L206(lines 202 608) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L854 garLoopResultBuilder]: At program point L212(lines 208 606) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 14:18:34,814 INFO L858 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L854 garLoopResultBuilder]: At program point L563(lines 75 687) the Hoare annotation is: false [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L861 garLoopResultBuilder]: At program point L215(lines 214 604) the Hoare annotation is: true [2022-01-10 14:18:34,815 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 603) the Hoare annotation is: true [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 681) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2022-01-10 14:18:34,815 INFO L858 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2022-01-10 14:18:34,818 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:34,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 14:18:34,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:34 BasicIcfg [2022-01-10 14:18:34,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 14:18:34,863 INFO L158 Benchmark]: Toolchain (without parser) took 13979.60ms. Allocated memory was 223.3MB in the beginning and 422.6MB in the end (delta: 199.2MB). Free memory was 169.0MB in the beginning and 325.6MB in the end (delta: -156.6MB). Peak memory consumption was 236.2MB. Max. memory is 8.0GB. [2022-01-10 14:18:34,863 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 223.3MB. Free memory was 186.4MB in the beginning and 186.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 14:18:34,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.91ms. Allocated memory is still 223.3MB. Free memory was 168.7MB in the beginning and 190.8MB in the end (delta: -22.1MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-01-10 14:18:34,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.83ms. Allocated memory is still 223.3MB. Free memory was 190.8MB in the beginning and 188.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:34,863 INFO L158 Benchmark]: Boogie Preprocessor took 21.27ms. Allocated memory is still 223.3MB. Free memory was 188.2MB in the beginning and 186.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:34,864 INFO L158 Benchmark]: RCFGBuilder took 551.98ms. Allocated memory is still 223.3MB. Free memory was 186.1MB in the beginning and 160.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-10 14:18:34,864 INFO L158 Benchmark]: IcfgTransformer took 159.53ms. Allocated memory is still 223.3MB. Free memory was 160.4MB in the beginning and 144.2MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 14:18:34,864 INFO L158 Benchmark]: TraceAbstraction took 12875.14ms. Allocated memory was 223.3MB in the beginning and 422.6MB in the end (delta: 199.2MB). Free memory was 143.7MB in the beginning and 325.6MB in the end (delta: -181.9MB). Peak memory consumption was 210.9MB. Max. memory is 8.0GB. [2022-01-10 14:18:34,865 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 223.3MB. Free memory was 186.4MB in the beginning and 186.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.91ms. Allocated memory is still 223.3MB. Free memory was 168.7MB in the beginning and 190.8MB in the end (delta: -22.1MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.83ms. Allocated memory is still 223.3MB. Free memory was 190.8MB in the beginning and 188.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.27ms. Allocated memory is still 223.3MB. Free memory was 188.2MB in the beginning and 186.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 551.98ms. Allocated memory is still 223.3MB. Free memory was 186.1MB in the beginning and 160.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * IcfgTransformer took 159.53ms. Allocated memory is still 223.3MB. Free memory was 160.4MB in the beginning and 144.2MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12875.14ms. Allocated memory was 223.3MB in the beginning and 422.6MB in the end (delta: 199.2MB). Free memory was 143.7MB in the beginning and 325.6MB in the end (delta: -181.9MB). Peak memory consumption was 210.9MB. 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: 681]: 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, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 19, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1758 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1758 mSDsluCounter, 7203 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3034 mSDsCounter, 469 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2538 IncrementalHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 469 mSolverCounterUnsat, 4169 mSDtfsCounter, 2538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2243 GetRequests, 2209 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4990occurred in iteration=18, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 1677 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 616 NumberOfFragments, 667 HoareAnnotationTreeSize, 29 FomulaSimplifications, 11079 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 11460 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 5465 NumberOfCodeBlocks, 5465 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6417 ConstructedInterpolants, 0 QuantifiedInterpolants, 10209 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4690 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 24 InterpolantComputations, 17 PerfectInterpolantSequences, 25575/25757 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: 196]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || (!(s__hit == 0bv32) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) && 8448bv32 == s__state) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && 8448bv32 == s__state) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 0bv32) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(s__state, 8672bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 14:18:34,906 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...