./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:02:03,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:02:03,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:02:03,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:02:03,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:02:03,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:02:03,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:02:03,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:02:03,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:02:03,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:02:03,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:02:03,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:02:03,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:02:03,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:02:03,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:02:03,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:02:03,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:02:03,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:02:03,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:02:03,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:02:03,778 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:02:03,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:02:03,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:02:03,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:02:03,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:02:03,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:02:03,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:02:03,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:02:03,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:02:03,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:02:03,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:02:03,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:02:03,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:02:03,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:02:03,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:02:03,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:02:03,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:02:03,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:02:03,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:02:03,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:02:03,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:02:03,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:02:03,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 11:02:03,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:02:03,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:02:03,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:02:03,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:02:03,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:02:03,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:02:03,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:02:03,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:02:03,822 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:02:03,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:02:03,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:02:03,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 11:02:03,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:02:03,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:02:03,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:02:03,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:02:03,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:02:03,823 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:02:03,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:02:03,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:02:03,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:02:03,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:02:03,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:02:03,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:02:03,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:02:03,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:02:03,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:02:03,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:02:03,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 11:02:03,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 11:02:03,826 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:02:03,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:02:03,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:02:03,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf [2022-07-19 11:02:04,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:02:04,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:02:04,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:02:04,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:02:04,088 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:02:04,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2022-07-19 11:02:04,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166ab1894/5f1e21cfb9a24022a0ac5add80703ef1/FLAG91196f8d0 [2022-07-19 11:02:04,763 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:02:04,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2022-07-19 11:02:04,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166ab1894/5f1e21cfb9a24022a0ac5add80703ef1/FLAG91196f8d0 [2022-07-19 11:02:05,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166ab1894/5f1e21cfb9a24022a0ac5add80703ef1 [2022-07-19 11:02:05,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:02:05,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:02:05,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:02:05,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:02:05,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:02:05,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b332564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05, skipping insertion in model container [2022-07-19 11:02:05,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:02:05,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:02:05,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2022-07-19 11:02:05,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:02:05,589 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:02:05,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2022-07-19 11:02:05,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:02:05,759 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:02:05,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05 WrapperNode [2022-07-19 11:02:05,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:02:05,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:02:05,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:02:05,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:02:05,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,853 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 782 [2022-07-19 11:02:05,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:02:05,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:02:05,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:02:05,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:02:05,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:02:05,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:02:05,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:02:05,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:02:05,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (1/1) ... [2022-07-19 11:02:05,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:02:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:02:05,986 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-07-19 11:02:06,008 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-07-19 11:02:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:02:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:02:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 11:02:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 11:02:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:02:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 11:02:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:02:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:02:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:02:06,216 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:02:06,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:02:06,244 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:02:08,985 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:02:08,986 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:02:08,986 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:02:08,998 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:02:08,999 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:02:09,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:09 BoogieIcfgContainer [2022-07-19 11:02:09,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:02:09,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:02:09,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:02:09,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:02:09,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:02:05" (1/3) ... [2022-07-19 11:02:09,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314ed783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:09, skipping insertion in model container [2022-07-19 11:02:09,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:05" (2/3) ... [2022-07-19 11:02:09,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314ed783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:09, skipping insertion in model container [2022-07-19 11:02:09,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:09" (3/3) ... [2022-07-19 11:02:09,012 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2022-07-19 11:02:09,024 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:02:09,025 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:02:09,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:02:09,077 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2796407c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68e5288d [2022-07-19 11:02:09,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:02:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 11:02:09,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:09,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:09,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2022-07-19 11:02:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:09,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234787845] [2022-07-19 11:02:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:09,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234787845] [2022-07-19 11:02:09,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234787845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:09,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:09,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704055614] [2022-07-19 11:02:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:09,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:09,733 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 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 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:11,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:12,345 INFO L93 Difference]: Finished difference Result 406 states and 687 transitions. [2022-07-19 11:02:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:12,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-07-19 11:02:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:12,357 INFO L225 Difference]: With dead ends: 406 [2022-07-19 11:02:12,358 INFO L226 Difference]: Without dead ends: 246 [2022-07-19 11:02:12,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:12,363 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 142 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:12,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 411 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 11:02:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-19 11:02:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 175. [2022-07-19 11:02:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.6091954022988506) internal successors, (280), 174 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2022-07-19 11:02:12,438 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 47 [2022-07-19 11:02:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:12,439 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2022-07-19 11:02:12,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2022-07-19 11:02:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 11:02:12,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:12,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:12,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 11:02:12,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1376829262, now seen corresponding path program 1 times [2022-07-19 11:02:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:12,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567600412] [2022-07-19 11:02:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:12,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:12,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567600412] [2022-07-19 11:02:12,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567600412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:12,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:12,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594161158] [2022-07-19 11:02:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:12,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:12,584 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:14,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:14,900 INFO L93 Difference]: Finished difference Result 368 states and 587 transitions. [2022-07-19 11:02:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-19 11:02:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:14,903 INFO L225 Difference]: With dead ends: 368 [2022-07-19 11:02:14,903 INFO L226 Difference]: Without dead ends: 203 [2022-07-19 11:02:14,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:14,905 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:14,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 439 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-19 11:02:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-19 11:02:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6162162162162161) internal successors, (299), 185 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 299 transitions. [2022-07-19 11:02:14,919 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 299 transitions. Word has length 48 [2022-07-19 11:02:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:14,920 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 299 transitions. [2022-07-19 11:02:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 299 transitions. [2022-07-19 11:02:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 11:02:14,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:14,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 11:02:14,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1875534592, now seen corresponding path program 1 times [2022-07-19 11:02:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:14,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586202064] [2022-07-19 11:02:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:15,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586202064] [2022-07-19 11:02:15,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586202064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:15,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:15,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:15,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445891948] [2022-07-19 11:02:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:15,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:15,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:15,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:15,052 INFO L87 Difference]: Start difference. First operand 186 states and 299 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:17,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:17,327 INFO L93 Difference]: Finished difference Result 368 states and 586 transitions. [2022-07-19 11:02:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:17,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-19 11:02:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:17,330 INFO L225 Difference]: With dead ends: 368 [2022-07-19 11:02:17,330 INFO L226 Difference]: Without dead ends: 203 [2022-07-19 11:02:17,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:17,332 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 24 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:17,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 441 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-19 11:02:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-19 11:02:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6108108108108108) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-07-19 11:02:17,342 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 298 transitions. Word has length 61 [2022-07-19 11:02:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:17,342 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-19 11:02:17,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-07-19 11:02:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:17,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:17,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:17,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 11:02:17,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1839351473, now seen corresponding path program 1 times [2022-07-19 11:02:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:17,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766863080] [2022-07-19 11:02:17,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:17,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766863080] [2022-07-19 11:02:17,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766863080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:17,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:17,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:17,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692150530] [2022-07-19 11:02:17,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:17,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:17,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:17,504 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:19,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:19,725 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-07-19 11:02:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:19,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-19 11:02:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:19,727 INFO L225 Difference]: With dead ends: 367 [2022-07-19 11:02:19,727 INFO L226 Difference]: Without dead ends: 202 [2022-07-19 11:02:19,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:19,729 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 28 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:19,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-19 11:02:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-19 11:02:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6054054054054054) internal successors, (297), 185 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 297 transitions. [2022-07-19 11:02:19,737 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 297 transitions. Word has length 62 [2022-07-19 11:02:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:19,737 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 297 transitions. [2022-07-19 11:02:19,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 297 transitions. [2022-07-19 11:02:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:19,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:19,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:19,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 11:02:19,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:19,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1630821317, now seen corresponding path program 1 times [2022-07-19 11:02:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380660871] [2022-07-19 11:02:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:19,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:19,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380660871] [2022-07-19 11:02:19,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380660871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:19,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:19,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:19,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5480171] [2022-07-19 11:02:19,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:19,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:19,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:19,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:19,853 INFO L87 Difference]: Start difference. First operand 186 states and 297 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:21,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:22,116 INFO L93 Difference]: Finished difference Result 367 states and 583 transitions. [2022-07-19 11:02:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:22,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-19 11:02:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:22,119 INFO L225 Difference]: With dead ends: 367 [2022-07-19 11:02:22,119 INFO L226 Difference]: Without dead ends: 202 [2022-07-19 11:02:22,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:22,120 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 26 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:22,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-19 11:02:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-19 11:02:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 296 transitions. [2022-07-19 11:02:22,127 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 296 transitions. Word has length 62 [2022-07-19 11:02:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:22,128 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 296 transitions. [2022-07-19 11:02:22,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 296 transitions. [2022-07-19 11:02:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:22,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:22,129 INFO L195 NwaCegarLoop]: trace histogram [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-07-19 11:02:22,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 11:02:22,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash 509961732, now seen corresponding path program 1 times [2022-07-19 11:02:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:22,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336515276] [2022-07-19 11:02:22,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:22,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:22,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:22,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336515276] [2022-07-19 11:02:22,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336515276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:22,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:22,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:22,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572423058] [2022-07-19 11:02:22,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:22,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:22,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:22,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:22,248 INFO L87 Difference]: Start difference. First operand 186 states and 296 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:24,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:24,492 INFO L93 Difference]: Finished difference Result 366 states and 581 transitions. [2022-07-19 11:02:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:24,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-19 11:02:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:24,495 INFO L225 Difference]: With dead ends: 366 [2022-07-19 11:02:24,495 INFO L226 Difference]: Without dead ends: 201 [2022-07-19 11:02:24,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:24,496 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 19 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:24,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 445 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-19 11:02:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2022-07-19 11:02:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5945945945945945) internal successors, (295), 185 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 295 transitions. [2022-07-19 11:02:24,502 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 295 transitions. Word has length 62 [2022-07-19 11:02:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:24,503 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 295 transitions. [2022-07-19 11:02:24,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 295 transitions. [2022-07-19 11:02:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:24,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:24,504 INFO L195 NwaCegarLoop]: trace histogram [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-07-19 11:02:24,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 11:02:24,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1144939844, now seen corresponding path program 1 times [2022-07-19 11:02:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:24,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687765853] [2022-07-19 11:02:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:24,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687765853] [2022-07-19 11:02:24,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687765853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:24,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:24,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:24,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461605016] [2022-07-19 11:02:24,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:24,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:24,608 INFO L87 Difference]: Start difference. First operand 186 states and 295 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:25,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:25,945 INFO L93 Difference]: Finished difference Result 364 states and 578 transitions. [2022-07-19 11:02:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:25,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-19 11:02:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:25,947 INFO L225 Difference]: With dead ends: 364 [2022-07-19 11:02:25,947 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 11:02:25,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:25,948 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:25,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 11:02:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 11:02:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-19 11:02:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5891891891891892) internal successors, (294), 185 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 294 transitions. [2022-07-19 11:02:25,953 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 294 transitions. Word has length 62 [2022-07-19 11:02:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:25,954 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 294 transitions. [2022-07-19 11:02:25,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 294 transitions. [2022-07-19 11:02:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 11:02:25,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:25,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:25,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 11:02:25,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1652438455, now seen corresponding path program 1 times [2022-07-19 11:02:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:25,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679660449] [2022-07-19 11:02:25,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:26,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679660449] [2022-07-19 11:02:26,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679660449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:26,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:26,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561040937] [2022-07-19 11:02:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:26,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:26,054 INFO L87 Difference]: Start difference. First operand 186 states and 294 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:28,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:28,262 INFO L93 Difference]: Finished difference Result 364 states and 577 transitions. [2022-07-19 11:02:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:28,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-19 11:02:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:28,264 INFO L225 Difference]: With dead ends: 364 [2022-07-19 11:02:28,264 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 11:02:28,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:28,265 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 22 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:28,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 11:02:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-19 11:02:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5837837837837838) internal successors, (293), 185 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2022-07-19 11:02:28,270 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 63 [2022-07-19 11:02:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:28,271 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2022-07-19 11:02:28,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2022-07-19 11:02:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 11:02:28,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:28,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:28,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 11:02:28,272 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash -848424362, now seen corresponding path program 1 times [2022-07-19 11:02:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:28,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808177077] [2022-07-19 11:02:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808177077] [2022-07-19 11:02:28,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808177077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:28,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:28,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234722765] [2022-07-19 11:02:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:28,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:28,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:28,374 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:30,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:30,582 INFO L93 Difference]: Finished difference Result 364 states and 576 transitions. [2022-07-19 11:02:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:30,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-07-19 11:02:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:30,584 INFO L225 Difference]: With dead ends: 364 [2022-07-19 11:02:30,584 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 11:02:30,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:30,585 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 20 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:30,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 11:02:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-19 11:02:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 185 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 292 transitions. [2022-07-19 11:02:30,590 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 292 transitions. Word has length 64 [2022-07-19 11:02:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:30,590 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 292 transitions. [2022-07-19 11:02:30,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 292 transitions. [2022-07-19 11:02:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 11:02:30,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:30,592 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:30,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 11:02:30,592 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:30,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:30,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2026506290, now seen corresponding path program 1 times [2022-07-19 11:02:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:30,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390336192] [2022-07-19 11:02:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:30,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390336192] [2022-07-19 11:02:30,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390336192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:30,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290350614] [2022-07-19 11:02:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:30,681 INFO L87 Difference]: Start difference. First operand 186 states and 292 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:32,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:32,907 INFO L93 Difference]: Finished difference Result 354 states and 562 transitions. [2022-07-19 11:02:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:32,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-07-19 11:02:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:32,908 INFO L225 Difference]: With dead ends: 354 [2022-07-19 11:02:32,908 INFO L226 Difference]: Without dead ends: 189 [2022-07-19 11:02:32,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:32,909 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:32,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 463 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-19 11:02:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-07-19 11:02:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.572972972972973) internal successors, (291), 185 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2022-07-19 11:02:32,914 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 65 [2022-07-19 11:02:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:32,915 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2022-07-19 11:02:32,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2022-07-19 11:02:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 11:02:32,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:32,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:32,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 11:02:32,916 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1546297802, now seen corresponding path program 1 times [2022-07-19 11:02:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:32,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577384822] [2022-07-19 11:02:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577384822] [2022-07-19 11:02:33,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577384822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:33,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:33,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200123585] [2022-07-19 11:02:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:33,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:33,023 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:35,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:35,391 INFO L93 Difference]: Finished difference Result 465 states and 733 transitions. [2022-07-19 11:02:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:35,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-07-19 11:02:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:35,393 INFO L225 Difference]: With dead ends: 465 [2022-07-19 11:02:35,393 INFO L226 Difference]: Without dead ends: 298 [2022-07-19 11:02:35,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:35,394 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 111 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:35,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 312 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-19 11:02:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 228. [2022-07-19 11:02:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6255506607929515) internal successors, (369), 227 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2022-07-19 11:02:35,423 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 65 [2022-07-19 11:02:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:35,424 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2022-07-19 11:02:35,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2022-07-19 11:02:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 11:02:35,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:35,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:35,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 11:02:35,425 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 632591508, now seen corresponding path program 1 times [2022-07-19 11:02:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:35,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089419266] [2022-07-19 11:02:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:35,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:35,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089419266] [2022-07-19 11:02:35,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089419266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:35,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:35,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461151350] [2022-07-19 11:02:35,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:35,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:35,538 INFO L87 Difference]: Start difference. First operand 228 states and 369 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:37,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:37,452 INFO L93 Difference]: Finished difference Result 544 states and 881 transitions. [2022-07-19 11:02:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-07-19 11:02:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:37,455 INFO L225 Difference]: With dead ends: 544 [2022-07-19 11:02:37,455 INFO L226 Difference]: Without dead ends: 337 [2022-07-19 11:02:37,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:37,456 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 119 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:37,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 11:02:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-19 11:02:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 260. [2022-07-19 11:02:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.6447876447876448) internal successors, (426), 259 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 426 transitions. [2022-07-19 11:02:37,463 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 426 transitions. Word has length 93 [2022-07-19 11:02:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:37,464 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 426 transitions. [2022-07-19 11:02:37,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 426 transitions. [2022-07-19 11:02:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 11:02:37,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:37,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:37,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 11:02:37,466 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1221146161, now seen corresponding path program 1 times [2022-07-19 11:02:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:37,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469392953] [2022-07-19 11:02:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469392953] [2022-07-19 11:02:37,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469392953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:37,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:37,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892015416] [2022-07-19 11:02:37,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:37,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:37,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:37,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:37,608 INFO L87 Difference]: Start difference. First operand 260 states and 426 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:38,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:39,193 INFO L93 Difference]: Finished difference Result 613 states and 1000 transitions. [2022-07-19 11:02:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-19 11:02:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:39,195 INFO L225 Difference]: With dead ends: 613 [2022-07-19 11:02:39,195 INFO L226 Difference]: Without dead ends: 374 [2022-07-19 11:02:39,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:39,196 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:39,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 318 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 11:02:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-19 11:02:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 303. [2022-07-19 11:02:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.6622516556291391) internal successors, (502), 302 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 502 transitions. [2022-07-19 11:02:39,204 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 502 transitions. Word has length 105 [2022-07-19 11:02:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:39,204 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 502 transitions. [2022-07-19 11:02:39,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 502 transitions. [2022-07-19 11:02:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:02:39,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:39,205 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-19 11:02:39,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 11:02:39,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1500161074, now seen corresponding path program 1 times [2022-07-19 11:02:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:39,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047835579] [2022-07-19 11:02:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:39,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:39,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047835579] [2022-07-19 11:02:39,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047835579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:39,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:39,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:39,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50617771] [2022-07-19 11:02:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:39,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:39,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:39,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:39,311 INFO L87 Difference]: Start difference. First operand 303 states and 502 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:41,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:41,672 INFO L93 Difference]: Finished difference Result 697 states and 1149 transitions. [2022-07-19 11:02:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:41,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 106 [2022-07-19 11:02:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:41,674 INFO L225 Difference]: With dead ends: 697 [2022-07-19 11:02:41,674 INFO L226 Difference]: Without dead ends: 415 [2022-07-19 11:02:41,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:41,675 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 136 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:41,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 302 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-19 11:02:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 319. [2022-07-19 11:02:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.650943396226415) internal successors, (525), 318 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 525 transitions. [2022-07-19 11:02:41,683 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 525 transitions. Word has length 106 [2022-07-19 11:02:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:41,683 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 525 transitions. [2022-07-19 11:02:41,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 525 transitions. [2022-07-19 11:02:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:02:41,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:41,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:41,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 11:02:41,685 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:41,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2144263610, now seen corresponding path program 1 times [2022-07-19 11:02:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:41,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041433165] [2022-07-19 11:02:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 11:02:41,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041433165] [2022-07-19 11:02:41,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041433165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:41,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:41,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703584490] [2022-07-19 11:02:41,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:41,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:41,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:41,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:41,782 INFO L87 Difference]: Start difference. First operand 319 states and 525 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:43,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:44,059 INFO L93 Difference]: Finished difference Result 661 states and 1092 transitions. [2022-07-19 11:02:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 106 [2022-07-19 11:02:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:44,061 INFO L225 Difference]: With dead ends: 661 [2022-07-19 11:02:44,061 INFO L226 Difference]: Without dead ends: 363 [2022-07-19 11:02:44,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:44,062 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 35 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:44,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 461 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-19 11:02:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 341. [2022-07-19 11:02:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6529411764705881) internal successors, (562), 340 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 562 transitions. [2022-07-19 11:02:44,071 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 562 transitions. Word has length 106 [2022-07-19 11:02:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:44,071 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 562 transitions. [2022-07-19 11:02:44,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 562 transitions. [2022-07-19 11:02:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 11:02:44,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:44,073 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 11:02:44,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 11:02:44,073 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1195785078, now seen corresponding path program 1 times [2022-07-19 11:02:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027970481] [2022-07-19 11:02:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:44,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027970481] [2022-07-19 11:02:44,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027970481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:44,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:44,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870416386] [2022-07-19 11:02:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:44,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:44,180 INFO L87 Difference]: Start difference. First operand 341 states and 562 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:46,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:46,556 INFO L93 Difference]: Finished difference Result 731 states and 1193 transitions. [2022-07-19 11:02:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-19 11:02:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:46,558 INFO L225 Difference]: With dead ends: 731 [2022-07-19 11:02:46,558 INFO L226 Difference]: Without dead ends: 411 [2022-07-19 11:02:46,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:46,559 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 135 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:46,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 11:02:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-07-19 11:02:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 341. [2022-07-19 11:02:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.638235294117647) internal successors, (557), 340 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 557 transitions. [2022-07-19 11:02:46,568 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 557 transitions. Word has length 107 [2022-07-19 11:02:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:46,568 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 557 transitions. [2022-07-19 11:02:46,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 557 transitions. [2022-07-19 11:02:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 11:02:46,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:46,569 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:46,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 11:02:46,570 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash 240959469, now seen corresponding path program 1 times [2022-07-19 11:02:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:46,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456973407] [2022-07-19 11:02:46,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:46,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:46,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456973407] [2022-07-19 11:02:46,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456973407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:46,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:46,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043078512] [2022-07-19 11:02:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:46,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:46,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:46,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:46,690 INFO L87 Difference]: Start difference. First operand 341 states and 557 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:48,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:49,047 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2022-07-19 11:02:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:49,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 120 [2022-07-19 11:02:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:49,049 INFO L225 Difference]: With dead ends: 730 [2022-07-19 11:02:49,050 INFO L226 Difference]: Without dead ends: 410 [2022-07-19 11:02:49,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:49,051 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 140 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:49,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-19 11:02:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-19 11:02:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6205882352941177) internal successors, (551), 340 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 551 transitions. [2022-07-19 11:02:49,058 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 551 transitions. Word has length 120 [2022-07-19 11:02:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:49,058 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 551 transitions. [2022-07-19 11:02:49,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 551 transitions. [2022-07-19 11:02:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 11:02:49,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:49,060 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:49,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 11:02:49,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1953173121, now seen corresponding path program 1 times [2022-07-19 11:02:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:49,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31034318] [2022-07-19 11:02:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:49,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31034318] [2022-07-19 11:02:49,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31034318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:49,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:49,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997780197] [2022-07-19 11:02:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:49,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:49,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:49,166 INFO L87 Difference]: Start difference. First operand 341 states and 551 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:51,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:51,560 INFO L93 Difference]: Finished difference Result 730 states and 1170 transitions. [2022-07-19 11:02:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:51,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 120 [2022-07-19 11:02:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:51,562 INFO L225 Difference]: With dead ends: 730 [2022-07-19 11:02:51,562 INFO L226 Difference]: Without dead ends: 410 [2022-07-19 11:02:51,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:51,563 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 138 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:51,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 304 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 11:02:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-19 11:02:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-19 11:02:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6029411764705883) internal successors, (545), 340 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 545 transitions. [2022-07-19 11:02:51,572 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 545 transitions. Word has length 120 [2022-07-19 11:02:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:51,572 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 545 transitions. [2022-07-19 11:02:51,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 545 transitions. [2022-07-19 11:02:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 11:02:51,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:51,574 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:51,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 11:02:51,575 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:51,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1985043260, now seen corresponding path program 1 times [2022-07-19 11:02:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:51,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134636815] [2022-07-19 11:02:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 11:02:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:51,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134636815] [2022-07-19 11:02:51,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134636815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:51,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:51,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115232931] [2022-07-19 11:02:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:51,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:51,680 INFO L87 Difference]: Start difference. First operand 341 states and 545 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:52,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:52,891 INFO L93 Difference]: Finished difference Result 679 states and 1090 transitions. [2022-07-19 11:02:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 120 [2022-07-19 11:02:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:52,893 INFO L225 Difference]: With dead ends: 679 [2022-07-19 11:02:52,893 INFO L226 Difference]: Without dead ends: 359 [2022-07-19 11:02:52,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:52,894 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 35 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:52,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 11:02:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-19 11:02:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 341. [2022-07-19 11:02:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6) internal successors, (544), 340 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 544 transitions. [2022-07-19 11:02:52,902 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 544 transitions. Word has length 120 [2022-07-19 11:02:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:52,902 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 544 transitions. [2022-07-19 11:02:52,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 544 transitions. [2022-07-19 11:02:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 11:02:52,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:52,904 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:52,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 11:02:52,904 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1586861309, now seen corresponding path program 1 times [2022-07-19 11:02:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:52,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388441031] [2022-07-19 11:02:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:53,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388441031] [2022-07-19 11:02:53,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388441031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:53,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:53,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769617871] [2022-07-19 11:02:53,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:53,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:53,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:53,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:53,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:53,013 INFO L87 Difference]: Start difference. First operand 341 states and 544 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:55,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:55,231 INFO L93 Difference]: Finished difference Result 679 states and 1088 transitions. [2022-07-19 11:02:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:55,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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-07-19 11:02:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:55,233 INFO L225 Difference]: With dead ends: 679 [2022-07-19 11:02:55,233 INFO L226 Difference]: Without dead ends: 359 [2022-07-19 11:02:55,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:55,235 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 39 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:55,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-19 11:02:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 341. [2022-07-19 11:02:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5970588235294119) internal successors, (543), 340 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 543 transitions. [2022-07-19 11:02:55,242 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 543 transitions. Word has length 121 [2022-07-19 11:02:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:55,242 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 543 transitions. [2022-07-19 11:02:55,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 543 transitions. [2022-07-19 11:02:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 11:02:55,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:55,244 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:55,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 11:02:55,244 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1735358010, now seen corresponding path program 1 times [2022-07-19 11:02:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:55,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188409370] [2022-07-19 11:02:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188409370] [2022-07-19 11:02:55,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188409370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:55,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:55,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943842239] [2022-07-19 11:02:55,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:55,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:55,348 INFO L87 Difference]: Start difference. First operand 341 states and 543 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:57,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:57,663 INFO L93 Difference]: Finished difference Result 730 states and 1154 transitions. [2022-07-19 11:02:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-19 11:02:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:57,665 INFO L225 Difference]: With dead ends: 730 [2022-07-19 11:02:57,666 INFO L226 Difference]: Without dead ends: 410 [2022-07-19 11:02:57,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:57,667 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 135 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:57,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-19 11:02:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-19 11:02:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5794117647058823) internal successors, (537), 340 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 537 transitions. [2022-07-19 11:02:57,675 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 537 transitions. Word has length 122 [2022-07-19 11:02:57,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:57,675 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 537 transitions. [2022-07-19 11:02:57,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 537 transitions. [2022-07-19 11:02:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 11:02:57,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:57,677 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 11:02:57,677 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2093537762, now seen corresponding path program 1 times [2022-07-19 11:02:57,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:57,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721728427] [2022-07-19 11:02:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:57,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721728427] [2022-07-19 11:02:57,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721728427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:57,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:57,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:57,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452414829] [2022-07-19 11:02:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:57,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:57,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:57,777 INFO L87 Difference]: Start difference. First operand 341 states and 537 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:59,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:59,580 INFO L93 Difference]: Finished difference Result 669 states and 1061 transitions. [2022-07-19 11:02:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:59,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 123 [2022-07-19 11:02:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:59,582 INFO L225 Difference]: With dead ends: 669 [2022-07-19 11:02:59,582 INFO L226 Difference]: Without dead ends: 349 [2022-07-19 11:02:59,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:59,584 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 28 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:59,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 483 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 11:02:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-19 11:02:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 341. [2022-07-19 11:02:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.576470588235294) internal successors, (536), 340 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 536 transitions. [2022-07-19 11:02:59,591 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 536 transitions. Word has length 123 [2022-07-19 11:02:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:59,592 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 536 transitions. [2022-07-19 11:02:59,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 536 transitions. [2022-07-19 11:02:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:02:59,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:59,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-07-19 11:02:59,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 11:02:59,594 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1960687741, now seen corresponding path program 1 times [2022-07-19 11:02:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:59,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048575577] [2022-07-19 11:02:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 11:02:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048575577] [2022-07-19 11:02:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048575577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:59,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:59,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:02:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158745020] [2022-07-19 11:02:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:02:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:59,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:02:59,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:59,979 INFO L87 Difference]: Start difference. First operand 341 states and 536 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:01,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:04,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:04,257 INFO L93 Difference]: Finished difference Result 679 states and 1068 transitions. [2022-07-19 11:03:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:03:04,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 127 [2022-07-19 11:03:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:04,259 INFO L225 Difference]: With dead ends: 679 [2022-07-19 11:03:04,259 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 11:03:04,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 11:03:04,260 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:04,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 11:03:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 11:03:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-19 11:03:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5735294117647058) internal successors, (535), 340 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 535 transitions. [2022-07-19 11:03:04,267 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 535 transitions. Word has length 127 [2022-07-19 11:03:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:04,268 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 535 transitions. [2022-07-19 11:03:04,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 535 transitions. [2022-07-19 11:03:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:04,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:04,269 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-07-19 11:03:04,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 11:03:04,270 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1254091135, now seen corresponding path program 1 times [2022-07-19 11:03:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:03:04,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892395323] [2022-07-19 11:03:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:03:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:04,800 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:03:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:05,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 11:03:05,127 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:03:05,128 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:03:05,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 11:03:05,137 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:05,141 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:03:05,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:03:05 BoogieIcfgContainer [2022-07-19 11:03:05,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:03:05,313 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:03:05,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:03:05,314 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:03:05,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:09" (3/4) ... [2022-07-19 11:03:05,317 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 11:03:05,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:03:05,317 INFO L158 Benchmark]: Toolchain (without parser) took 60142.14ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 61.1MB in the beginning and 76.5MB in the end (delta: -15.4MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-07-19 11:03:05,318 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.8MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:03:05,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.47ms. Allocated memory is still 96.5MB. Free memory was 60.9MB in the beginning and 51.1MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 11:03:05,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.18ms. Allocated memory is still 96.5MB. Free memory was 51.1MB in the beginning and 46.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 11:03:05,318 INFO L158 Benchmark]: Boogie Preprocessor took 82.48ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 46.2MB in the beginning and 99.2MB in the end (delta: -53.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-07-19 11:03:05,318 INFO L158 Benchmark]: RCFGBuilder took 3058.27ms. Allocated memory is still 125.8MB. Free memory was 99.1MB in the beginning and 66.1MB in the end (delta: 33.0MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2022-07-19 11:03:05,319 INFO L158 Benchmark]: TraceAbstraction took 56307.19ms. Allocated memory is still 125.8MB. Free memory was 65.2MB in the beginning and 76.5MB in the end (delta: -11.3MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2022-07-19 11:03:05,319 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 125.8MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:03:05,320 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.20ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.8MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.47ms. Allocated memory is still 96.5MB. Free memory was 60.9MB in the beginning and 51.1MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.18ms. Allocated memory is still 96.5MB. Free memory was 51.1MB in the beginning and 46.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.48ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 46.2MB in the beginning and 99.2MB in the end (delta: -53.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3058.27ms. Allocated memory is still 125.8MB. Free memory was 99.1MB in the beginning and 66.1MB in the end (delta: 33.0MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * TraceAbstraction took 56307.19ms. Allocated memory is still 125.8MB. Free memory was 65.2MB in the beginning and 76.5MB in the end (delta: -11.3MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 125.8MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 1733]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->info_callback={0:-12}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-12}, blastFlag=1, got_new_session=0, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1382] COND FALSE !(ret <= 0) [L1387] s->hit VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1387] COND TRUE s->hit [L1388] s->state = 8656 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1392] s->init_num = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1585] EXPR s->session [L1585] EXPR s->s3 [L1585] EXPR (s->s3)->tmp.new_cipher [L1585] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1586] COND FALSE !(! tmp___9) [L1592] ret = __VERIFIER_nondet_int() [L1593] COND TRUE blastFlag == 2 [L1594] blastFlag = 3 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1605] COND FALSE !(! tmp___10) VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1733] reach_error() VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.1s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 1502 SdHoareTripleChecker+Valid, 50.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1502 mSDsluCounter, 9447 SdHoareTripleChecker+Invalid, 49.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5867 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4420 IncrementalHoareTripleChecker+Invalid, 5054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 3580 mSDtfsCounter, 4420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 851 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2008 ConstructedInterpolants, 0 QuantifiedInterpolants, 4903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1128/1128 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 11:03:05,374 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:03:07,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:03:07,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:03:07,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:03:07,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:03:07,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:03:07,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:03:07,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:03:07,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:03:07,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:03:07,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:03:07,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:03:07,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:03:07,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:03:07,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:03:07,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:03:07,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:03:07,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:03:07,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:03:07,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:03:07,356 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:03:07,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:03:07,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:03:07,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:03:07,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:03:07,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:03:07,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:03:07,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:03:07,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:03:07,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:03:07,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:03:07,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:03:07,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:03:07,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:03:07,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:03:07,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:03:07,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:03:07,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:03:07,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:03:07,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:03:07,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:03:07,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:03:07,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 11:03:07,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:03:07,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:03:07,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:03:07,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:03:07,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:03:07,415 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:03:07,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:03:07,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:03:07,416 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:03:07,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:03:07,417 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:03:07,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:03:07,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:03:07,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:03:07,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:03:07,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:03:07,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 11:03:07,419 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 11:03:07,419 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 11:03:07,419 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:03:07,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:03:07,419 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:03:07,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:03:07,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:03:07,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:03:07,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:03:07,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:03:07,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:03:07,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:03:07,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:03:07,421 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 11:03:07,422 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 11:03:07,422 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:03:07,422 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:03:07,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:03:07,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 11:03:07,423 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf [2022-07-19 11:03:07,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:03:07,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:03:07,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:03:07,799 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:03:07,800 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:03:07,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2022-07-19 11:03:07,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb184ec5/543c1138ae7e4a2fb89b105b27c9b797/FLAGed6c7641a [2022-07-19 11:03:08,484 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:03:08,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2022-07-19 11:03:08,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb184ec5/543c1138ae7e4a2fb89b105b27c9b797/FLAGed6c7641a [2022-07-19 11:03:08,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb184ec5/543c1138ae7e4a2fb89b105b27c9b797 [2022-07-19 11:03:08,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:03:08,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:03:08,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:03:08,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:03:08,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:03:08,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:03:08" (1/1) ... [2022-07-19 11:03:08,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78101f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:08, skipping insertion in model container [2022-07-19 11:03:08,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:03:08" (1/1) ... [2022-07-19 11:03:08,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:03:08,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:03:09,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2022-07-19 11:03:09,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:09,264 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 11:03:09,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:03:09,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2022-07-19 11:03:09,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:09,358 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:03:09,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2022-07-19 11:03:09,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:09,475 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:03:09,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09 WrapperNode [2022-07-19 11:03:09,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:03:09,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:03:09,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:03:09,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:03:09,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,562 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 752 [2022-07-19 11:03:09,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:03:09,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:03:09,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:03:09,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:03:09,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:03:09,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:03:09,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:03:09,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:03:09,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (1/1) ... [2022-07-19 11:03:09,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:03:09,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:03:09,729 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-07-19 11:03:09,749 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-07-19 11:03:09,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:03:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 11:03:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:03:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 11:03:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:03:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:03:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:03:09,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:03:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 11:03:09,951 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:03:09,953 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:03:09,968 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:03:17,668 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:03:17,669 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:03:17,669 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:03:17,679 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:03:17,679 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:03:17,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:17 BoogieIcfgContainer [2022-07-19 11:03:17,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:03:17,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:03:17,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:03:17,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:03:17,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:03:08" (1/3) ... [2022-07-19 11:03:17,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d259599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:17, skipping insertion in model container [2022-07-19 11:03:17,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:09" (2/3) ... [2022-07-19 11:03:17,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d259599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:17, skipping insertion in model container [2022-07-19 11:03:17,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:17" (3/3) ... [2022-07-19 11:03:17,691 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2022-07-19 11:03:17,705 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:03:17,705 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:03:17,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:03:17,786 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22c291a4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b6e68ab [2022-07-19 11:03:17,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:03:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 11:03:17,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:17,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:17,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2022-07-19 11:03:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865401427] [2022-07-19 11:03:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:17,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:17,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:17,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:17,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 11:03:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:18,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:18,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:03:18,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:18,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:18,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865401427] [2022-07-19 11:03:18,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865401427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:18,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:18,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630625078] [2022-07-19 11:03:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:18,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:18,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:18,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:18,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:18,644 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:18,753 INFO L93 Difference]: Finished difference Result 412 states and 698 transitions. [2022-07-19 11:03:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:18,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-07-19 11:03:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:18,769 INFO L225 Difference]: With dead ends: 412 [2022-07-19 11:03:18,769 INFO L226 Difference]: Without dead ends: 251 [2022-07-19 11:03:18,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-07-19 11:03:18,781 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 186 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:18,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 456 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:03:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-19 11:03:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-07-19 11:03:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.516) internal successors, (379), 250 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2022-07-19 11:03:18,856 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 47 [2022-07-19 11:03:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:18,856 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2022-07-19 11:03:18,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2022-07-19 11:03:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 11:03:18,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:18,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:18,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:19,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:19,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1889550317, now seen corresponding path program 1 times [2022-07-19 11:03:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:19,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910465777] [2022-07-19 11:03:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:19,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:19,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:19,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 11:03:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:19,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:19,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:03:19,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:19,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:19,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910465777] [2022-07-19 11:03:19,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910465777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:19,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:19,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670183877] [2022-07-19 11:03:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:19,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:19,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:19,746 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:19,843 INFO L93 Difference]: Finished difference Result 489 states and 744 transitions. [2022-07-19 11:03:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-07-19 11:03:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:19,846 INFO L225 Difference]: With dead ends: 489 [2022-07-19 11:03:19,846 INFO L226 Difference]: Without dead ends: 367 [2022-07-19 11:03:19,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-07-19 11:03:19,847 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 134 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:19,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 557 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:03:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-19 11:03:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-07-19 11:03:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 554 transitions. [2022-07-19 11:03:19,866 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 554 transitions. Word has length 64 [2022-07-19 11:03:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:19,866 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 554 transitions. [2022-07-19 11:03:19,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 554 transitions. [2022-07-19 11:03:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 11:03:19,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:19,870 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:19,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:20,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:20,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -617936825, now seen corresponding path program 1 times [2022-07-19 11:03:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:20,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312698485] [2022-07-19 11:03:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:20,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:20,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 11:03:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:20,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:20,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:03:20,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:20,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312698485] [2022-07-19 11:03:20,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312698485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:20,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:20,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199280397] [2022-07-19 11:03:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:20,809 INFO L87 Difference]: Start difference. First operand 367 states and 554 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-07-19 11:03:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:20,903 INFO L93 Difference]: Finished difference Result 723 states and 1098 transitions. [2022-07-19 11:03:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:20,903 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 86 [2022-07-19 11:03:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:20,906 INFO L225 Difference]: With dead ends: 723 [2022-07-19 11:03:20,906 INFO L226 Difference]: Without dead ends: 485 [2022-07-19 11:03:20,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-07-19 11:03:20,908 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:20,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 561 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:03:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-19 11:03:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2022-07-19 11:03:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.512396694214876) internal successors, (732), 484 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 732 transitions. [2022-07-19 11:03:20,924 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 732 transitions. Word has length 86 [2022-07-19 11:03:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:20,924 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 732 transitions. [2022-07-19 11:03:20,925 INFO L496 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-07-19 11:03:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 732 transitions. [2022-07-19 11:03:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:20,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:20,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-07-19 11:03:20,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:21,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:21,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1960687741, now seen corresponding path program 1 times [2022-07-19 11:03:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:21,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983123110] [2022-07-19 11:03:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:21,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:21,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:21,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:21,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 11:03:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:22,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 11:03:22,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:22,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 11:03:22,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 11:03:22,735 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-19 11:03:22,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 58 treesize of output 85 [2022-07-19 11:03:22,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:22,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2022-07-19 11:03:23,063 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-19 11:03:23,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-19 11:03:23,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-19 11:03:23,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 11:03:23,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 11:03:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 11:03:23,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:23,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:23,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983123110] [2022-07-19 11:03:23,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983123110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:23,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:23,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:03:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730618572] [2022-07-19 11:03:23,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:23,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:03:23,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:23,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:03:23,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:03:23,180 INFO L87 Difference]: Start difference. First operand 485 states and 732 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:25,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:27,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:29,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:34,122 INFO L93 Difference]: Finished difference Result 967 states and 1460 transitions. [2022-07-19 11:03:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:03:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 127 [2022-07-19 11:03:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:34,127 INFO L225 Difference]: With dead ends: 967 [2022-07-19 11:03:34,127 INFO L226 Difference]: Without dead ends: 485 [2022-07-19 11:03:34,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 11:03:34,128 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:34,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2022-07-19 11:03:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-19 11:03:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2022-07-19 11:03:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 731 transitions. [2022-07-19 11:03:34,146 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 731 transitions. Word has length 127 [2022-07-19 11:03:34,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:34,146 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 731 transitions. [2022-07-19 11:03:34,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 731 transitions. [2022-07-19 11:03:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:34,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:34,151 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-07-19 11:03:34,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-19 11:03:34,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:34,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1254091135, now seen corresponding path program 1 times [2022-07-19 11:03:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:34,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397239878] [2022-07-19 11:03:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:34,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:34,370 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:34,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 11:03:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:37,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:03:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:39,182 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-19 11:03:39,195 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:03:39,197 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:03:39,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:39,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:39,415 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-19 11:03:39,418 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:03:39,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:03:39 BoogieIcfgContainer [2022-07-19 11:03:39,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:03:39,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:03:39,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:03:39,556 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:03:39,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:17" (3/4) ... [2022-07-19 11:03:39,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 11:03:39,681 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 11:03:39,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:03:39,682 INFO L158 Benchmark]: Toolchain (without parser) took 30837.33ms. Allocated memory was 60.8MB in the beginning and 92.3MB in the end (delta: 31.5MB). Free memory was 42.7MB in the beginning and 21.9MB in the end (delta: 20.8MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2022-07-19 11:03:39,682 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 46.1MB. Free memory was 28.2MB in the beginning and 28.1MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:03:39,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.02ms. Allocated memory is still 60.8MB. Free memory was 42.4MB in the beginning and 36.4MB in the end (delta: 6.0MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2022-07-19 11:03:39,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.84ms. Allocated memory is still 60.8MB. Free memory was 36.4MB in the beginning and 31.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 11:03:39,684 INFO L158 Benchmark]: Boogie Preprocessor took 131.70ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 51.8MB in the end (delta: -20.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-07-19 11:03:39,684 INFO L158 Benchmark]: RCFGBuilder took 7986.78ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.8MB in the beginning and 54.1MB in the end (delta: -2.3MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-07-19 11:03:39,684 INFO L158 Benchmark]: TraceAbstraction took 21871.18ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 37.9MB in the end (delta: 16.2MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-07-19 11:03:39,684 INFO L158 Benchmark]: Witness Printer took 125.80ms. Allocated memory is still 92.3MB. Free memory was 37.9MB in the beginning and 21.9MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 11:03:39,688 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.19ms. Allocated memory is still 46.1MB. Free memory was 28.2MB in the beginning and 28.1MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.02ms. Allocated memory is still 60.8MB. Free memory was 42.4MB in the beginning and 36.4MB in the end (delta: 6.0MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.84ms. Allocated memory is still 60.8MB. Free memory was 36.4MB in the beginning and 31.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.70ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 51.8MB in the end (delta: -20.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7986.78ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.8MB in the beginning and 54.1MB in the end (delta: -2.3MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21871.18ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 37.9MB in the end (delta: 16.2MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 125.80ms. Allocated memory is still 92.3MB. Free memory was 37.9MB in the beginning and 21.9MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 1733]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->cert={-2147483644:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-1073741818:0}, s={-1073741818:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->s3={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1382] COND FALSE !(ret <= 0) [L1387] s->hit VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1387] COND TRUE s->hit [L1388] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1392] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->s3={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1260] COND TRUE s->state == 8656 [L1585] EXPR s->session [L1585] EXPR s->s3 [L1585] EXPR (s->s3)->tmp.new_cipher [L1585] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1586] COND FALSE !(! tmp___9) [L1592] ret = __VERIFIER_nondet_int() [L1593] COND TRUE blastFlag == 2 [L1594] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1605] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->s3={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-1073741818:0}, s={-1073741818:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=8, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1733] reach_error() VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=8, s={-1073741818:0}, s={-1073741818:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 2205 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1033 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1172 mSDtfsCounter, 210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 668 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2830 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 153/153 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-19 11:03:39,757 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE