./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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.01.i.cil-2.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 a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:37:10,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:37:10,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:37:10,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:37:10,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:37:10,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:37:10,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:37:10,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:37:10,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:37:10,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:37:10,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:37:10,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:37:10,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:37:10,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:37:10,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:37:10,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:37:10,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:37:10,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:37:10,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:37:10,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:37:10,748 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:37:10,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:37:10,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:37:10,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:37:10,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:37:10,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:37:10,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:37:10,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:37:10,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:37:10,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:37:10,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:37:10,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:37:10,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:37:10,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:37:10,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:37:10,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:37:10,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:37:10,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:37:10,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:37:10,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:37:10,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:37:10,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:37:10,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:37:10,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:37:10,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:37:10,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:37:10,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:37:10,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:37:10,811 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:37:10,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:37:10,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:37:10,812 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:37:10,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:37:10,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:37:10,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:37:10,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:37:10,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:37:10,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:37:10,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:37:10,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:37:10,815 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:37:10,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:37:10,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:37:10,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:37:10,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:37:10,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:37:10,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:37:10,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:37:10,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:37:10,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:37:10,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:37:10,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:37:10,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:37:10,818 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:37:10,819 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:37:10,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:37:10,819 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 -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-20 22:37:11,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:37:11,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:37:11,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:37:11,202 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:37:11,203 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:37:11,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-20 22:37:11,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1306edc/57f1aa8a14714e968cfaf73d6b1763aa/FLAG61d6c9764 [2022-07-20 22:37:11,767 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:37:11,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-20 22:37:11,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1306edc/57f1aa8a14714e968cfaf73d6b1763aa/FLAG61d6c9764 [2022-07-20 22:37:12,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1306edc/57f1aa8a14714e968cfaf73d6b1763aa [2022-07-20 22:37:12,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:37:12,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:37:12,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:37:12,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:37:12,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:37:12,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364145aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12, skipping insertion in model container [2022-07-20 22:37:12,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:37:12,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:37:12,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.01.i.cil-2.c[72913,72926] [2022-07-20 22:37:12,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:37:12,593 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:37:12,735 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.01.i.cil-2.c[72913,72926] [2022-07-20 22:37:12,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:37:12,774 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:37:12,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12 WrapperNode [2022-07-20 22:37:12,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:37:12,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:37:12,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:37:12,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:37:12,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,881 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2022-07-20 22:37:12,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:37:12,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:37:12,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:37:12,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:37:12,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:37:12,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:37:12,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:37:12,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:37:12,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (1/1) ... [2022-07-20 22:37:12,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:37:13,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:37:13,021 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-20 22:37:13,035 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-20 22:37:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:37:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:37:13,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:37:13,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:37:13,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:37:13,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:37:13,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:37:13,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:37:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:37:13,223 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:37:13,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:37:13,273 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:37:16,046 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-20 22:37:16,046 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-20 22:37:16,046 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:37:16,052 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:37:16,052 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:37:16,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:37:16 BoogieIcfgContainer [2022-07-20 22:37:16,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:37:16,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:37:16,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:37:16,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:37:16,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:37:12" (1/3) ... [2022-07-20 22:37:16,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad8cbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:37:16, skipping insertion in model container [2022-07-20 22:37:16,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:37:12" (2/3) ... [2022-07-20 22:37:16,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad8cbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:37:16, skipping insertion in model container [2022-07-20 22:37:16,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:37:16" (3/3) ... [2022-07-20 22:37:16,064 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-20 22:37:16,091 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:37:16,091 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:37:16,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:37:16,141 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@2269ad95, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@398468db [2022-07-20 22:37:16,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:37:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-20 22:37:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 22:37:16,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:16,161 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-20 22:37:16,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:16,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-20 22:37:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:16,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905717315] [2022-07-20 22:37:16,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:16,792 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-20 22:37:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905717315] [2022-07-20 22:37:16,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905717315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:16,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:16,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186756395] [2022-07-20 22:37:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:16,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:16,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:16,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:16,833 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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-20 22:37:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:18,132 INFO L93 Difference]: Finished difference Result 412 states and 693 transitions. [2022-07-20 22:37:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:18,134 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-20 22:37:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:18,144 INFO L225 Difference]: With dead ends: 412 [2022-07-20 22:37:18,144 INFO L226 Difference]: Without dead ends: 250 [2022-07-20 22:37:18,147 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-20 22:37:18,150 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:18,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 417 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 22:37:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-20 22:37:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2022-07-20 22:37:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.6079545454545454) internal successors, (283), 176 states have internal predecessors, (283), 0 states have call successors, (0), 0 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-20 22:37:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 283 transitions. [2022-07-20 22:37:18,190 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 283 transitions. Word has length 47 [2022-07-20 22:37:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:18,191 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 283 transitions. [2022-07-20 22:37:18,191 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-20 22:37:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 283 transitions. [2022-07-20 22:37:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:37:18,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:18,193 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-20 22:37:18,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:37:18,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1376827281, now seen corresponding path program 1 times [2022-07-20 22:37:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:18,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881094861] [2022-07-20 22:37:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:18,329 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-20 22:37:18,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:18,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881094861] [2022-07-20 22:37:18,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881094861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:18,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:18,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660088773] [2022-07-20 22:37:18,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:18,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:18,333 INFO L87 Difference]: Start difference. First operand 177 states and 283 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-20 22:37:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:19,233 INFO L93 Difference]: Finished difference Result 372 states and 593 transitions. [2022-07-20 22:37:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:19,234 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-20 22:37:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:19,235 INFO L225 Difference]: With dead ends: 372 [2022-07-20 22:37:19,236 INFO L226 Difference]: Without dead ends: 205 [2022-07-20 22:37:19,236 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-20 22:37:19,237 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 22 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:19,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 448 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 22:37:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-20 22:37:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2022-07-20 22:37:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6149732620320856) internal successors, (302), 187 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-20 22:37:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 302 transitions. [2022-07-20 22:37:19,249 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 302 transitions. Word has length 48 [2022-07-20 22:37:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:19,249 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 302 transitions. [2022-07-20 22:37:19,249 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-20 22:37:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 302 transitions. [2022-07-20 22:37:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 22:37:19,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:19,252 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-20 22:37:19,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:37:19,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1326962752, now seen corresponding path program 1 times [2022-07-20 22:37:19,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:19,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461438058] [2022-07-20 22:37:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:19,449 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-20 22:37:19,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:19,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461438058] [2022-07-20 22:37:19,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461438058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:19,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:19,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062650540] [2022-07-20 22:37:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:19,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:19,452 INFO L87 Difference]: Start difference. First operand 188 states and 302 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-20 22:37:21,462 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-20 22:37:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:21,882 INFO L93 Difference]: Finished difference Result 514 states and 830 transitions. [2022-07-20 22:37:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:21,883 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-20 22:37:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:21,885 INFO L225 Difference]: With dead ends: 514 [2022-07-20 22:37:21,885 INFO L226 Difference]: Without dead ends: 347 [2022-07-20 22:37:21,886 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-20 22:37:21,887 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:21,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 311 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 22:37:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-20 22:37:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 220. [2022-07-20 22:37:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6118721461187215) internal successors, (353), 219 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-20 22:37:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 353 transitions. [2022-07-20 22:37:21,909 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 353 transitions. Word has length 61 [2022-07-20 22:37:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:21,909 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 353 transitions. [2022-07-20 22:37:21,910 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-20 22:37:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 353 transitions. [2022-07-20 22:37:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 22:37:21,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:21,917 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-20 22:37:21,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 22:37:21,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:21,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1254725184, now seen corresponding path program 1 times [2022-07-20 22:37:21,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:21,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206288785] [2022-07-20 22:37:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:21,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:22,034 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-20 22:37:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206288785] [2022-07-20 22:37:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206288785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:22,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:22,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453960602] [2022-07-20 22:37:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:22,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:22,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:22,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:22,037 INFO L87 Difference]: Start difference. First operand 220 states and 353 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-20 22:37:24,044 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-20 22:37:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:24,284 INFO L93 Difference]: Finished difference Result 435 states and 694 transitions. [2022-07-20 22:37:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:24,285 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-20 22:37:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:24,286 INFO L225 Difference]: With dead ends: 435 [2022-07-20 22:37:24,287 INFO L226 Difference]: Without dead ends: 236 [2022-07-20 22:37:24,287 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-20 22:37:24,288 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:24,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 452 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:37:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-20 22:37:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2022-07-20 22:37:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6073059360730593) internal successors, (352), 219 states have internal predecessors, (352), 0 states have call successors, (0), 0 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-20 22:37:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2022-07-20 22:37:24,297 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 62 [2022-07-20 22:37:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:24,298 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2022-07-20 22:37:24,298 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-20 22:37:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2022-07-20 22:37:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 22:37:24,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:24,299 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-20 22:37:24,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 22:37:24,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1693511684, now seen corresponding path program 1 times [2022-07-20 22:37:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:24,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097777863] [2022-07-20 22:37:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:24,442 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-20 22:37:24,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:24,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097777863] [2022-07-20 22:37:24,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097777863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:24,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:24,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639645247] [2022-07-20 22:37:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:24,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:24,445 INFO L87 Difference]: Start difference. First operand 220 states and 352 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-20 22:37:26,452 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-20 22:37:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:26,790 INFO L93 Difference]: Finished difference Result 519 states and 825 transitions. [2022-07-20 22:37:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:26,790 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-20 22:37:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:26,792 INFO L225 Difference]: With dead ends: 519 [2022-07-20 22:37:26,792 INFO L226 Difference]: Without dead ends: 320 [2022-07-20 22:37:26,792 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-20 22:37:26,793 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:26,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 311 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:37:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-20 22:37:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 221. [2022-07-20 22:37:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5954545454545455) internal successors, (351), 220 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-20 22:37:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 351 transitions. [2022-07-20 22:37:26,800 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 351 transitions. Word has length 62 [2022-07-20 22:37:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:26,802 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 351 transitions. [2022-07-20 22:37:26,802 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-20 22:37:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 351 transitions. [2022-07-20 22:37:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 22:37:26,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:26,813 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, 1] [2022-07-20 22:37:26,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 22:37:26,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:26,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1066809839, now seen corresponding path program 1 times [2022-07-20 22:37:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:26,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506891271] [2022-07-20 22:37:26,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:26,947 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-20 22:37:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:26,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506891271] [2022-07-20 22:37:26,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506891271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:26,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:26,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:26,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259582759] [2022-07-20 22:37:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:26,950 INFO L87 Difference]: Start difference. First operand 221 states and 351 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-20 22:37:28,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:37:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:29,110 INFO L93 Difference]: Finished difference Result 519 states and 821 transitions. [2022-07-20 22:37:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:29,111 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-20 22:37:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:29,113 INFO L225 Difference]: With dead ends: 519 [2022-07-20 22:37:29,113 INFO L226 Difference]: Without dead ends: 319 [2022-07-20 22:37:29,113 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-20 22:37:29,114 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:29,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 22:37:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-20 22:37:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-20 22:37:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 220 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-20 22:37:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2022-07-20 22:37:29,135 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 63 [2022-07-20 22:37:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:29,135 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2022-07-20 22:37:29,135 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-20 22:37:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2022-07-20 22:37:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 22:37:29,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:29,137 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, 1] [2022-07-20 22:37:29,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 22:37:29,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1102657701, now seen corresponding path program 1 times [2022-07-20 22:37:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:29,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860717725] [2022-07-20 22:37:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:29,253 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-20 22:37:29,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860717725] [2022-07-20 22:37:29,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860717725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:29,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:29,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:29,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430109452] [2022-07-20 22:37:29,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:29,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:29,257 INFO L87 Difference]: Start difference. First operand 221 states and 347 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-20 22:37:31,271 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-20 22:37:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:31,479 INFO L93 Difference]: Finished difference Result 434 states and 682 transitions. [2022-07-20 22:37:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:31,480 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-20 22:37:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:31,481 INFO L225 Difference]: With dead ends: 434 [2022-07-20 22:37:31,481 INFO L226 Difference]: Without dead ends: 234 [2022-07-20 22:37:31,482 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-20 22:37:31,482 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 458 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-20 22:37:31,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:37:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-20 22:37:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2022-07-20 22:37:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5727272727272728) internal successors, (346), 220 states have internal predecessors, (346), 0 states have call successors, (0), 0 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-20 22:37:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2022-07-20 22:37:31,489 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 63 [2022-07-20 22:37:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:31,490 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2022-07-20 22:37:31,490 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-20 22:37:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2022-07-20 22:37:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 22:37:31,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:31,491 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, 1] [2022-07-20 22:37:31,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 22:37:31,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash -195504471, now seen corresponding path program 1 times [2022-07-20 22:37:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:31,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328312629] [2022-07-20 22:37:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:31,573 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-20 22:37:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:31,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328312629] [2022-07-20 22:37:31,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328312629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:31,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:31,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376297246] [2022-07-20 22:37:31,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:31,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:31,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:31,576 INFO L87 Difference]: Start difference. First operand 221 states and 346 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-20 22:37:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:32,933 INFO L93 Difference]: Finished difference Result 519 states and 813 transitions. [2022-07-20 22:37:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:32,934 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-20 22:37:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:32,937 INFO L225 Difference]: With dead ends: 519 [2022-07-20 22:37:32,937 INFO L226 Difference]: Without dead ends: 319 [2022-07-20 22:37:32,938 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-20 22:37:32,938 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:32,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 22:37:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-20 22:37:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-20 22:37:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 220 states have internal predecessors, (342), 0 states have call successors, (0), 0 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-20 22:37:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 342 transitions. [2022-07-20 22:37:32,952 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 342 transitions. Word has length 64 [2022-07-20 22:37:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:32,954 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 342 transitions. [2022-07-20 22:37:32,954 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-20 22:37:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 342 transitions. [2022-07-20 22:37:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 22:37:32,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:32,955 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-20 22:37:32,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 22:37:32,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 307896966, now seen corresponding path program 1 times [2022-07-20 22:37:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:32,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762849960] [2022-07-20 22:37:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:33,102 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-20 22:37:33,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:33,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762849960] [2022-07-20 22:37:33,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762849960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:33,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:33,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092833106] [2022-07-20 22:37:33,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:33,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:33,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:33,106 INFO L87 Difference]: Start difference. First operand 221 states and 342 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-20 22:37:35,113 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-20 22:37:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:35,461 INFO L93 Difference]: Finished difference Result 519 states and 806 transitions. [2022-07-20 22:37:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:35,461 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-20 22:37:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:35,463 INFO L225 Difference]: With dead ends: 519 [2022-07-20 22:37:35,463 INFO L226 Difference]: Without dead ends: 317 [2022-07-20 22:37:35,463 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-20 22:37:35,464 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:35,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:37:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-20 22:37:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 246. [2022-07-20 22:37:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 245 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-20 22:37:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2022-07-20 22:37:35,471 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 65 [2022-07-20 22:37:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:35,472 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2022-07-20 22:37:35,472 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-20 22:37:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2022-07-20 22:37:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 22:37:35,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:35,473 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, 1] [2022-07-20 22:37:35,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 22:37:35,474 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1634406600, now seen corresponding path program 1 times [2022-07-20 22:37:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:35,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650852516] [2022-07-20 22:37:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 22:37:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:35,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650852516] [2022-07-20 22:37:35,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650852516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:35,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:35,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:35,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839055017] [2022-07-20 22:37:35,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:35,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:35,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:35,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:35,587 INFO L87 Difference]: Start difference. First operand 246 states and 391 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-20 22:37:36,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:37:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:37,166 INFO L93 Difference]: Finished difference Result 511 states and 814 transitions. [2022-07-20 22:37:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:37,167 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 94 [2022-07-20 22:37:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:37,168 INFO L225 Difference]: With dead ends: 511 [2022-07-20 22:37:37,168 INFO L226 Difference]: Without dead ends: 286 [2022-07-20 22:37:37,169 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-20 22:37:37,169 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:37,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-20 22:37:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-20 22:37:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-07-20 22:37:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 0 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-20 22:37:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2022-07-20 22:37:37,176 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 94 [2022-07-20 22:37:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:37,176 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2022-07-20 22:37:37,177 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-20 22:37:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2022-07-20 22:37:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 22:37:37,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:37,178 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:37:37,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 22:37:37,178 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash 217673300, now seen corresponding path program 1 times [2022-07-20 22:37:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:37,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733186645] [2022-07-20 22:37:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 22:37:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733186645] [2022-07-20 22:37:37,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733186645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:37,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:37,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182166094] [2022-07-20 22:37:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:37,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:37,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:37,283 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:37:38,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:37:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:38,695 INFO L93 Difference]: Finished difference Result 528 states and 840 transitions. [2022-07-20 22:37:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:38,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-20 22:37:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:38,697 INFO L225 Difference]: With dead ends: 528 [2022-07-20 22:37:38,698 INFO L226 Difference]: Without dead ends: 281 [2022-07-20 22:37:38,698 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-20 22:37:38,699 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 20 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 458 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:38,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 22:37:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-20 22:37:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2022-07-20 22:37:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5880149812734083) internal successors, (424), 267 states have internal predecessors, (424), 0 states have call successors, (0), 0 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-20 22:37:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 424 transitions. [2022-07-20 22:37:38,706 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 424 transitions. Word has length 94 [2022-07-20 22:37:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:38,706 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 424 transitions. [2022-07-20 22:37:38,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:37:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 424 transitions. [2022-07-20 22:37:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 22:37:38,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:38,708 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:37:38,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 22:37:38,708 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1724300080, now seen corresponding path program 1 times [2022-07-20 22:37:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:38,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501342467] [2022-07-20 22:37:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 22:37:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501342467] [2022-07-20 22:37:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501342467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:38,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:38,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786954822] [2022-07-20 22:37:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:38,832 INFO L87 Difference]: Start difference. First operand 268 states and 424 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-20 22:37:40,840 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-20 22:37:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:41,038 INFO L93 Difference]: Finished difference Result 518 states and 826 transitions. [2022-07-20 22:37:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 95 [2022-07-20 22:37:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:41,040 INFO L225 Difference]: With dead ends: 518 [2022-07-20 22:37:41,040 INFO L226 Difference]: Without dead ends: 271 [2022-07-20 22:37:41,041 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-20 22:37:41,042 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 472 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-20 22:37:41,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 472 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:37:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-20 22:37:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2022-07-20 22:37:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5842696629213484) internal successors, (423), 267 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-20 22:37:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 423 transitions. [2022-07-20 22:37:41,056 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 423 transitions. Word has length 95 [2022-07-20 22:37:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:41,056 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 423 transitions. [2022-07-20 22:37:41,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-20 22:37:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 423 transitions. [2022-07-20 22:37:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 22:37:41,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:41,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:37:41,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 22:37:41,062 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1693697111, now seen corresponding path program 1 times [2022-07-20 22:37:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:41,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162718597] [2022-07-20 22:37:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 22:37:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:41,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162718597] [2022-07-20 22:37:41,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162718597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:41,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:41,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205016253] [2022-07-20 22:37:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:41,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:41,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:41,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:41,178 INFO L87 Difference]: Start difference. First operand 268 states and 423 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-20 22:37:43,185 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-20 22:37:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:43,405 INFO L93 Difference]: Finished difference Result 532 states and 844 transitions. [2022-07-20 22:37:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 108 [2022-07-20 22:37:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:43,407 INFO L225 Difference]: With dead ends: 532 [2022-07-20 22:37:43,407 INFO L226 Difference]: Without dead ends: 285 [2022-07-20 22:37:43,408 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-20 22:37:43,408 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 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-20 22:37:43,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:37:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-20 22:37:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 268. [2022-07-20 22:37:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5805243445692885) internal successors, (422), 267 states have internal predecessors, (422), 0 states have call successors, (0), 0 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-20 22:37:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 422 transitions. [2022-07-20 22:37:43,415 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 422 transitions. Word has length 108 [2022-07-20 22:37:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:43,415 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 422 transitions. [2022-07-20 22:37:43,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-20 22:37:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 422 transitions. [2022-07-20 22:37:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 22:37:43,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:43,417 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:37:43,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 22:37:43,417 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 778760430, now seen corresponding path program 1 times [2022-07-20 22:37:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:43,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185226246] [2022-07-20 22:37:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 22:37:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:43,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185226246] [2022-07-20 22:37:43,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185226246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:43,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:43,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787373700] [2022-07-20 22:37:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:43,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:43,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:43,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:43,542 INFO L87 Difference]: Start difference. First operand 268 states and 422 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-20 22:37:45,549 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-20 22:37:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:45,896 INFO L93 Difference]: Finished difference Result 586 states and 915 transitions. [2022-07-20 22:37:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:45,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 109 [2022-07-20 22:37:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:45,898 INFO L225 Difference]: With dead ends: 586 [2022-07-20 22:37:45,898 INFO L226 Difference]: Without dead ends: 339 [2022-07-20 22:37:45,899 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-20 22:37:45,899 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 331 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-20 22:37:45,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:37:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-20 22:37:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-20 22:37:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5655430711610487) internal successors, (418), 267 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-20 22:37:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 418 transitions. [2022-07-20 22:37:45,906 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 418 transitions. Word has length 109 [2022-07-20 22:37:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:45,906 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 418 transitions. [2022-07-20 22:37:45,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-20 22:37:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 418 transitions. [2022-07-20 22:37:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-20 22:37:45,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:45,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:37:45,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 22:37:45,908 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1220545399, now seen corresponding path program 1 times [2022-07-20 22:37:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:45,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314036401] [2022-07-20 22:37:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 22:37:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:46,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314036401] [2022-07-20 22:37:46,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314036401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:46,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:46,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767953355] [2022-07-20 22:37:46,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:46,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:46,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:46,021 INFO L87 Difference]: Start difference. First operand 268 states and 418 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-20 22:37:48,030 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-20 22:37:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:48,366 INFO L93 Difference]: Finished difference Result 586 states and 907 transitions. [2022-07-20 22:37:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:48,367 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 111 [2022-07-20 22:37:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:48,368 INFO L225 Difference]: With dead ends: 586 [2022-07-20 22:37:48,369 INFO L226 Difference]: Without dead ends: 339 [2022-07-20 22:37:48,369 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-20 22:37:48,369 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 331 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-20 22:37:48,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:37:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-20 22:37:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-20 22:37:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.550561797752809) internal successors, (414), 267 states have internal predecessors, (414), 0 states have call successors, (0), 0 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-20 22:37:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 414 transitions. [2022-07-20 22:37:48,376 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 414 transitions. Word has length 111 [2022-07-20 22:37:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:48,377 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 414 transitions. [2022-07-20 22:37:48,377 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-20 22:37:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 414 transitions. [2022-07-20 22:37:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-20 22:37:48,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:48,378 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:37:48,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 22:37:48,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 89193371, now seen corresponding path program 1 times [2022-07-20 22:37:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:48,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657223204] [2022-07-20 22:37:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 22:37:48,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:48,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657223204] [2022-07-20 22:37:48,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657223204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:48,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:48,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:48,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381057547] [2022-07-20 22:37:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:48,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:48,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:48,491 INFO L87 Difference]: Start difference. First operand 268 states and 414 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-20 22:37:50,503 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-20 22:37:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:50,716 INFO L93 Difference]: Finished difference Result 522 states and 813 transitions. [2022-07-20 22:37:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:50,717 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 112 [2022-07-20 22:37:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:50,718 INFO L225 Difference]: With dead ends: 522 [2022-07-20 22:37:50,718 INFO L226 Difference]: Without dead ends: 275 [2022-07-20 22:37:50,718 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-20 22:37:50,719 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:50,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 492 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:37:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-20 22:37:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-07-20 22:37:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.546816479400749) internal successors, (413), 267 states have internal predecessors, (413), 0 states have call successors, (0), 0 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-20 22:37:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2022-07-20 22:37:50,726 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 112 [2022-07-20 22:37:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:50,727 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2022-07-20 22:37:50,727 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-20 22:37:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-07-20 22:37:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-20 22:37:50,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:50,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:37:50,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 22:37:50,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1884563494, now seen corresponding path program 1 times [2022-07-20 22:37:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:50,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185749945] [2022-07-20 22:37:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:37:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:50,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185749945] [2022-07-20 22:37:50,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185749945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:50,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:50,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601304234] [2022-07-20 22:37:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:50,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:50,859 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-20 22:37:52,865 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-20 22:37:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:53,180 INFO L93 Difference]: Finished difference Result 624 states and 964 transitions. [2022-07-20 22:37:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:53,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 116 [2022-07-20 22:37:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:53,182 INFO L225 Difference]: With dead ends: 624 [2022-07-20 22:37:53,182 INFO L226 Difference]: Without dead ends: 377 [2022-07-20 22:37:53,183 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-20 22:37:53,183 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 116 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:53,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 325 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:37:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-20 22:37:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 300. [2022-07-20 22:37:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5518394648829432) internal successors, (464), 299 states have internal predecessors, (464), 0 states have call successors, (0), 0 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-20 22:37:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 464 transitions. [2022-07-20 22:37:53,190 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 464 transitions. Word has length 116 [2022-07-20 22:37:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:53,190 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 464 transitions. [2022-07-20 22:37:53,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-20 22:37:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 464 transitions. [2022-07-20 22:37:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 22:37:53,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:53,192 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-20 22:37:53,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 22:37:53,193 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-20 22:37:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:53,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862997495] [2022-07-20 22:37:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:37:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:53,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862997495] [2022-07-20 22:37:53,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862997495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:53,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:53,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:37:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289467362] [2022-07-20 22:37:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:53,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:37:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:53,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:37:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:37:53,333 INFO L87 Difference]: Start difference. First operand 300 states and 464 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:37:55,347 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-20 22:37:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:55,644 INFO L93 Difference]: Finished difference Result 694 states and 1072 transitions. [2022-07-20 22:37:55,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:37:55,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-20 22:37:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:55,646 INFO L225 Difference]: With dead ends: 694 [2022-07-20 22:37:55,646 INFO L226 Difference]: Without dead ends: 415 [2022-07-20 22:37:55,647 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-20 22:37:55,651 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:55,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 315 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:37:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-20 22:37:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 343. [2022-07-20 22:37:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5614035087719298) internal successors, (534), 342 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-20 22:37:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 534 transitions. [2022-07-20 22:37:55,661 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 534 transitions. Word has length 127 [2022-07-20 22:37:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:55,661 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 534 transitions. [2022-07-20 22:37:55,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:37:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 534 transitions. [2022-07-20 22:37:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 22:37:55,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:55,663 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-20 22:37:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 22:37:55,663 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1658817010, now seen corresponding path program 1 times [2022-07-20 22:37:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:55,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629567587] [2022-07-20 22:37:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 22:37:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:55,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629567587] [2022-07-20 22:37:55,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629567587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:55,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:55,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:37:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435891686] [2022-07-20 22:37:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:55,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:37:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:37:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:55,879 INFO L87 Difference]: Start difference. First operand 343 states and 534 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-20 22:37:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:55,909 INFO L93 Difference]: Finished difference Result 987 states and 1552 transitions. [2022-07-20 22:37:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:37:55,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 22:37:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:55,912 INFO L225 Difference]: With dead ends: 987 [2022-07-20 22:37:55,913 INFO L226 Difference]: Without dead ends: 665 [2022-07-20 22:37:55,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:55,914 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 143 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:55,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 558 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:37:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-20 22:37:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-07-20 22:37:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.566465256797583) internal successors, (1037), 662 states have internal predecessors, (1037), 0 states have call successors, (0), 0 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-20 22:37:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1037 transitions. [2022-07-20 22:37:55,945 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1037 transitions. Word has length 127 [2022-07-20 22:37:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:55,945 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1037 transitions. [2022-07-20 22:37:55,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-20 22:37:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1037 transitions. [2022-07-20 22:37:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 22:37:55,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:55,947 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-20 22:37:55,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 22:37:55,948 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash -390570832, now seen corresponding path program 1 times [2022-07-20 22:37:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:55,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306880913] [2022-07-20 22:37:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:37:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:56,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306880913] [2022-07-20 22:37:56,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306880913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:56,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:56,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:37:56,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731808999] [2022-07-20 22:37:56,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:56,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:37:56,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:56,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:37:56,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:56,085 INFO L87 Difference]: Start difference. First operand 663 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:37:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:56,117 INFO L93 Difference]: Finished difference Result 1580 states and 2483 transitions. [2022-07-20 22:37:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:37:56,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-20 22:37:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:56,121 INFO L225 Difference]: With dead ends: 1580 [2022-07-20 22:37:56,122 INFO L226 Difference]: Without dead ends: 938 [2022-07-20 22:37:56,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:56,124 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:56,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:37:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-20 22:37:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2022-07-20 22:37:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.5635005336179295) internal successors, (1465), 937 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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-20 22:37:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1465 transitions. [2022-07-20 22:37:56,149 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1465 transitions. Word has length 127 [2022-07-20 22:37:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:56,149 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1465 transitions. [2022-07-20 22:37:56,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:37:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1465 transitions. [2022-07-20 22:37:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 22:37:56,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:56,152 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-20 22:37:56,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 22:37:56,152 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1945821678, now seen corresponding path program 1 times [2022-07-20 22:37:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:56,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146000100] [2022-07-20 22:37:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-20 22:37:56,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:56,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146000100] [2022-07-20 22:37:56,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146000100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:56,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:56,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:37:56,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630439289] [2022-07-20 22:37:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:56,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:37:56,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:37:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:56,313 INFO L87 Difference]: Start difference. First operand 938 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-20 22:37:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:56,367 INFO L93 Difference]: Finished difference Result 1882 states and 2942 transitions. [2022-07-20 22:37:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:37:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-20 22:37:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:56,371 INFO L225 Difference]: With dead ends: 1882 [2022-07-20 22:37:56,371 INFO L226 Difference]: Without dead ends: 965 [2022-07-20 22:37:56,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:56,375 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:56,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 404 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:37:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-07-20 22:37:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2022-07-20 22:37:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.5560165975103735) internal successors, (1500), 964 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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-20 22:37:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1500 transitions. [2022-07-20 22:37:56,415 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1500 transitions. Word has length 127 [2022-07-20 22:37:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:56,418 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1500 transitions. [2022-07-20 22:37:56,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-20 22:37:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1500 transitions. [2022-07-20 22:37:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 22:37:56,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:56,421 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-20 22:37:56,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 22:37:56,421 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1322540076, now seen corresponding path program 1 times [2022-07-20 22:37:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:56,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344893920] [2022-07-20 22:37:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-20 22:37:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:56,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344893920] [2022-07-20 22:37:56,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344893920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:56,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:56,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:37:56,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631924350] [2022-07-20 22:37:56,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:56,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:37:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:37:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:56,534 INFO L87 Difference]: Start difference. First operand 965 states and 1500 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-20 22:37:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:37:56,576 INFO L93 Difference]: Finished difference Result 1591 states and 2470 transitions. [2022-07-20 22:37:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:37:56,577 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 127 [2022-07-20 22:37:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:37:56,579 INFO L225 Difference]: With dead ends: 1591 [2022-07-20 22:37:56,579 INFO L226 Difference]: Without dead ends: 647 [2022-07-20 22:37:56,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:37:56,581 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:37:56,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:37:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-20 22:37:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-20 22:37:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5386996904024768) internal successors, (994), 646 states have internal predecessors, (994), 0 states have call successors, (0), 0 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-20 22:37:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 994 transitions. [2022-07-20 22:37:56,597 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 994 transitions. Word has length 127 [2022-07-20 22:37:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:37:56,597 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 994 transitions. [2022-07-20 22:37:56,597 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-20 22:37:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 994 transitions. [2022-07-20 22:37:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 22:37:56,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:37:56,599 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, 1] [2022-07-20 22:37:56,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 22:37:56,600 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:37:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:37:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -116280318, now seen corresponding path program 1 times [2022-07-20 22:37:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:37:56,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869971685] [2022-07-20 22:37:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:37:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:37:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:37:57,029 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-20 22:37:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:37:57,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869971685] [2022-07-20 22:37:57,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869971685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:37:57,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:37:57,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:37:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750606592] [2022-07-20 22:37:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:37:57,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:37:57,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:37:57,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:37:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:37:57,032 INFO L87 Difference]: Start difference. First operand 647 states and 994 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-20 22:37:58,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:38:00,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:38:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:00,546 INFO L93 Difference]: Finished difference Result 1291 states and 1984 transitions. [2022-07-20 22:38:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:38:00,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 128 [2022-07-20 22:38:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:00,549 INFO L225 Difference]: With dead ends: 1291 [2022-07-20 22:38:00,549 INFO L226 Difference]: Without dead ends: 647 [2022-07-20 22:38:00,550 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-20 22:38:00,551 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:00,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-07-20 22:38:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-20 22:38:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-20 22:38:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5371517027863777) internal successors, (993), 646 states have internal predecessors, (993), 0 states have call successors, (0), 0 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-20 22:38:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 993 transitions. [2022-07-20 22:38:00,569 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 993 transitions. Word has length 128 [2022-07-20 22:38:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:00,569 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 993 transitions. [2022-07-20 22:38:00,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-20 22:38:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 993 transitions. [2022-07-20 22:38:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 22:38:00,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:00,572 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, 1] [2022-07-20 22:38:00,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 22:38:00,572 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:00,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-20 22:38:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:38:00,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784715927] [2022-07-20 22:38:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:38:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:38:01,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:38:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:38:01,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 22:38:01,361 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:38:01,362 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:38:01,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 22:38:01,367 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-20 22:38:01,371 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:38:01,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:38:01 BoogieIcfgContainer [2022-07-20 22:38:01,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:38:01,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:38:01,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:38:01,534 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:38:01,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:37:16" (3/4) ... [2022-07-20 22:38:01,538 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 22:38:01,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:38:01,538 INFO L158 Benchmark]: Toolchain (without parser) took 49459.77ms. Allocated memory was 60.8MB in the beginning and 264.2MB in the end (delta: 203.4MB). Free memory was 39.3MB in the beginning and 191.1MB in the end (delta: -151.8MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2022-07-20 22:38:01,538 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.9MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:38:01,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.26ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 39.1MB in the beginning and 52.1MB in the end (delta: -12.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-20 22:38:01,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.21ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 47.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:38:01,539 INFO L158 Benchmark]: Boogie Preprocessor took 100.10ms. Allocated memory is still 73.4MB. Free memory was 47.0MB in the beginning and 40.1MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 22:38:01,540 INFO L158 Benchmark]: RCFGBuilder took 3070.36ms. Allocated memory is still 73.4MB. Free memory was 40.1MB in the beginning and 35.2MB in the end (delta: 4.9MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-07-20 22:38:01,542 INFO L158 Benchmark]: TraceAbstraction took 45477.98ms. Allocated memory was 73.4MB in the beginning and 264.2MB in the end (delta: 190.8MB). Free memory was 34.8MB in the beginning and 192.2MB in the end (delta: -157.4MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. [2022-07-20 22:38:01,542 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 264.2MB. Free memory was 192.2MB in the beginning and 191.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:38:01,548 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.71ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.9MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.26ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 39.1MB in the beginning and 52.1MB in the end (delta: -12.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.21ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 47.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.10ms. Allocated memory is still 73.4MB. Free memory was 47.0MB in the beginning and 40.1MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3070.36ms. Allocated memory is still 73.4MB. Free memory was 40.1MB in the beginning and 35.2MB in the end (delta: 4.9MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45477.98ms. Allocated memory was 73.4MB in the beginning and 264.2MB in the end (delta: 190.8MB). Free memory was 34.8MB in the beginning and 192.2MB in the end (delta: -157.4MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 264.2MB. Free memory was 192.2MB in the beginning and 191.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 1737]: 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 1151. 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=0, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0, tmp___9=8] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1618] COND TRUE blastFlag == 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1737] reach_error() VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.2s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 40.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 1815 SdHoareTripleChecker+Valid, 39.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1815 mSDsluCounter, 9467 SdHoareTripleChecker+Invalid, 38.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5584 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4003 IncrementalHoareTripleChecker+Invalid, 4664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 3883 mSDtfsCounter, 4003 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=21, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 963 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2265 NumberOfCodeBlocks, 2265 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1192/1192 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-20 22:38:01,603 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.01.i.cil-2.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 a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:38:03,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:38:03,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:38:03,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:38:03,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:38:03,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:38:03,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:38:03,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:38:03,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:38:03,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:38:03,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:38:03,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:38:03,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:38:03,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:38:03,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:38:03,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:38:03,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:38:03,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:38:03,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:38:03,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:38:03,620 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:38:03,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:38:03,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:38:03,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:38:03,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:38:03,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:38:03,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:38:03,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:38:03,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:38:03,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:38:03,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:38:03,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:38:03,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:38:03,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:38:03,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:38:03,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:38:03,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:38:03,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:38:03,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:38:03,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:38:03,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:38:03,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:38:03,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 22:38:03,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:38:03,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:38:03,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:38:03,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:38:03,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:38:03,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:38:03,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:38:03,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:38:03,677 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:38:03,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:38:03,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:38:03,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:38:03,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:38:03,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:38:03,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:38:03,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:38:03,680 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 22:38:03,680 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 22:38:03,680 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 22:38:03,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:38:03,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:38:03,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:38:03,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:38:03,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:38:03,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:38:03,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:38:03,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:38:03,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:38:03,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:38:03,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:38:03,683 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 22:38:03,683 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 22:38:03,683 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:38:03,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:38:03,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:38:03,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 22:38:03,684 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 -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-20 22:38:03,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:38:03,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:38:03,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:38:03,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:38:03,992 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:38:03,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-20 22:38:04,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfbb004a/8e50b862b8504056952373819135dcd6/FLAGb820b3f04 [2022-07-20 22:38:04,662 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:38:04,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-20 22:38:04,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfbb004a/8e50b862b8504056952373819135dcd6/FLAGb820b3f04 [2022-07-20 22:38:05,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfbb004a/8e50b862b8504056952373819135dcd6 [2022-07-20 22:38:05,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:38:05,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:38:05,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:38:05,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:38:05,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:38:05,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ae65c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05, skipping insertion in model container [2022-07-20 22:38:05,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:38:05,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:38:05,507 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.01.i.cil-2.c[72913,72926] [2022-07-20 22:38:05,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:38:05,554 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 22:38:05,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:38:05,666 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.01.i.cil-2.c[72913,72926] [2022-07-20 22:38:05,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:38:05,679 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:38:05,795 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.01.i.cil-2.c[72913,72926] [2022-07-20 22:38:05,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:38:05,811 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:38:05,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05 WrapperNode [2022-07-20 22:38:05,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:38:05,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:38:05,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:38:05,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:38:05,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,910 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 757 [2022-07-20 22:38:05,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:38:05,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:38:05,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:38:05,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:38:05,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:05,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:38:05,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:38:06,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:38:06,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:38:06,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (1/1) ... [2022-07-20 22:38:06,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:38:06,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:38:06,045 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-20 22:38:06,055 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-20 22:38:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:38:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 22:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 22:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:38:06,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:38:06,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 22:38:06,307 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:38:06,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:38:06,344 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:38:14,375 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-20 22:38:14,375 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-20 22:38:14,375 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:38:14,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:38:14,382 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:38:14,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:38:14 BoogieIcfgContainer [2022-07-20 22:38:14,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:38:14,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:38:14,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:38:14,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:38:14,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:38:05" (1/3) ... [2022-07-20 22:38:14,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a88356e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:38:14, skipping insertion in model container [2022-07-20 22:38:14,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:05" (2/3) ... [2022-07-20 22:38:14,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a88356e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:38:14, skipping insertion in model container [2022-07-20 22:38:14,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:38:14" (3/3) ... [2022-07-20 22:38:14,392 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-20 22:38:14,411 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:38:14,412 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:38:14,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:38:14,478 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@1ce97918, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e62cf92 [2022-07-20 22:38:14,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:38:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-20 22:38:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 22:38:14,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:14,492 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-20 22:38:14,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-20 22:38:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:38:14,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967072701] [2022-07-20 22:38:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:14,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:38:14,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:38:14,509 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-20 22:38:14,511 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-20 22:38:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:15,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:38:15,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:38:15,281 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-20 22:38:15,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:38:15,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:38:15,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967072701] [2022-07-20 22:38:15,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967072701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:15,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:15,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:38:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724366564] [2022-07-20 22:38:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:15,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:38:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:38:15,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:38:15,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:38:15,315 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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-20 22:38:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:15,407 INFO L93 Difference]: Finished difference Result 418 states and 704 transitions. [2022-07-20 22:38:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:38:15,409 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-20 22:38:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:15,419 INFO L225 Difference]: With dead ends: 418 [2022-07-20 22:38:15,420 INFO L226 Difference]: Without dead ends: 255 [2022-07-20 22:38:15,423 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-20 22:38:15,426 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 187 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:15,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 457 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:38:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-20 22:38:15,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-07-20 22:38:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5118110236220472) internal successors, (384), 254 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-20 22:38:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2022-07-20 22:38:15,473 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 47 [2022-07-20 22:38:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:15,473 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2022-07-20 22:38:15,474 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-20 22:38:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2022-07-20 22:38:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 22:38:15,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:15,477 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-20 22:38:15,502 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-20 22:38:15,690 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-20 22:38:15,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash -682574659, now seen corresponding path program 1 times [2022-07-20 22:38:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:38:15,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229885775] [2022-07-20 22:38:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:15,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:38:15,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:38:15,694 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-20 22:38:15,696 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-20 22:38:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:16,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:38:16,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:38:16,433 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-20 22:38:16,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:38:16,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:38:16,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229885775] [2022-07-20 22:38:16,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229885775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:16,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:16,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:38:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005917167] [2022-07-20 22:38:16,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:16,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:38:16,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:38:16,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:38:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:38:16,437 INFO L87 Difference]: Start difference. First operand 255 states and 384 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-20 22:38:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:16,596 INFO L93 Difference]: Finished difference Result 498 states and 757 transitions. [2022-07-20 22:38:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:38:16,597 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-20 22:38:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:16,599 INFO L225 Difference]: With dead ends: 498 [2022-07-20 22:38:16,599 INFO L226 Difference]: Without dead ends: 374 [2022-07-20 22:38:16,600 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-20 22:38:16,601 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:16,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 562 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:38:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-20 22:38:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-07-20 22:38:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.5067024128686326) internal successors, (562), 373 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-20 22:38:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 562 transitions. [2022-07-20 22:38:16,618 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 562 transitions. Word has length 64 [2022-07-20 22:38:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:16,619 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 562 transitions. [2022-07-20 22:38:16,623 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-20 22:38:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 562 transitions. [2022-07-20 22:38:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-20 22:38:16,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:16,633 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-20 22:38:16,659 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-20 22:38:16,852 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-20 22:38:16,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:16,853 INFO L85 PathProgramCache]: Analyzing trace with hash 485035231, now seen corresponding path program 1 times [2022-07-20 22:38:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:38:16,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424523580] [2022-07-20 22:38:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:38:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:38:16,856 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-20 22:38:16,858 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-20 22:38:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:17,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:38:17,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:38:17,596 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-20 22:38:17,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:38:17,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:38:17,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424523580] [2022-07-20 22:38:17,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424523580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:17,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:17,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:38:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474076816] [2022-07-20 22:38:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:17,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:38:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:38:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:38:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:38:17,598 INFO L87 Difference]: Start difference. First operand 374 states and 562 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-20 22:38:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:17,707 INFO L93 Difference]: Finished difference Result 737 states and 1115 transitions. [2022-07-20 22:38:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:38:17,708 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-20 22:38:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:17,710 INFO L225 Difference]: With dead ends: 737 [2022-07-20 22:38:17,710 INFO L226 Difference]: Without dead ends: 494 [2022-07-20 22:38:17,711 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-20 22:38:17,712 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:17,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 566 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:38:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-20 22:38:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-07-20 22:38:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.5050709939148073) internal successors, (742), 493 states have internal predecessors, (742), 0 states have call successors, (0), 0 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-20 22:38:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 742 transitions. [2022-07-20 22:38:17,725 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 742 transitions. Word has length 86 [2022-07-20 22:38:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:17,726 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 742 transitions. [2022-07-20 22:38:17,726 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-20 22:38:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 742 transitions. [2022-07-20 22:38:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 22:38:17,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:17,728 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-20 22:38:17,754 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-20 22:38:17,947 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-20 22:38:17,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-20 22:38:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:38:17,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524936673] [2022-07-20 22:38:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:17,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:38:17,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:38:17,951 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-20 22:38:17,953 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-20 22:38:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:18,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:38:18,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:38:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 22:38:18,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:38:18,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:38:18,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524936673] [2022-07-20 22:38:18,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524936673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:18,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:18,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:38:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196709010] [2022-07-20 22:38:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:18,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:38:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:38:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:38:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:38:18,743 INFO L87 Difference]: Start difference. First operand 494 states and 742 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-20 22:38:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:18,863 INFO L93 Difference]: Finished difference Result 854 states and 1285 transitions. [2022-07-20 22:38:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:38:18,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 22:38:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:18,866 INFO L225 Difference]: With dead ends: 854 [2022-07-20 22:38:18,866 INFO L226 Difference]: Without dead ends: 491 [2022-07-20 22:38:18,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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-20 22:38:18,868 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 138 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:18,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 561 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:38:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-20 22:38:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-20 22:38:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.493877551020408) internal successors, (732), 490 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-20 22:38:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 732 transitions. [2022-07-20 22:38:18,879 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 732 transitions. Word has length 127 [2022-07-20 22:38:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:18,879 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 732 transitions. [2022-07-20 22:38:18,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-20 22:38:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 732 transitions. [2022-07-20 22:38:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 22:38:18,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:18,882 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, 1] [2022-07-20 22:38:18,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 22:38:19,095 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-20 22:38:19,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1760202500, now seen corresponding path program 1 times [2022-07-20 22:38:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:38:19,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449615469] [2022-07-20 22:38:19,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:19,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:38:19,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:38:19,099 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-20 22:38:19,100 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-20 22:38:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:20,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 22:38:20,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:38:20,264 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-20 22:38:20,277 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-20 22:38:20,946 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-20 22:38:20,947 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-20 22:38:20,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:20,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,073 INFO L244 Elim1Store]: Index analysis took 103 ms [2022-07-20 22:38:21,076 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-20 22:38:21,332 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-20 22:38:21,333 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-20 22:38:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:21,383 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-20 22:38:21,415 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-20 22:38:21,422 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-20 22:38:21,463 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-20 22:38:21,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:38:21,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:38:21,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449615469] [2022-07-20 22:38:21,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449615469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:21,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:21,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:38:21,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289000780] [2022-07-20 22:38:21,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:21,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:38:21,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:38:21,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:38:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:38:21,465 INFO L87 Difference]: Start difference. First operand 491 states and 732 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-20 22:38:23,493 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-20 22:38:25,500 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-20 22:38:27,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:38:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:32,542 INFO L93 Difference]: Finished difference Result 979 states and 1460 transitions. [2022-07-20 22:38:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:38:32,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 128 [2022-07-20 22:38:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:32,552 INFO L225 Difference]: With dead ends: 979 [2022-07-20 22:38:32,552 INFO L226 Difference]: Without dead ends: 491 [2022-07-20 22:38:32,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 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-20 22:38:32,554 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:32,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2022-07-20 22:38:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-20 22:38:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-20 22:38:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4918367346938775) internal successors, (731), 490 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-20 22:38:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 731 transitions. [2022-07-20 22:38:32,564 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 731 transitions. Word has length 128 [2022-07-20 22:38:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:32,564 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 731 transitions. [2022-07-20 22:38:32,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-20 22:38:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 731 transitions. [2022-07-20 22:38:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 22:38:32,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:32,566 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, 1] [2022-07-20 22:38:32,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-20 22:38:32,788 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-20 22:38:32,789 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:32,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1330544194, now seen corresponding path program 1 times [2022-07-20 22:38:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:38:32,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455520984] [2022-07-20 22:38:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:38:32,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:38:32,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:38:32,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 22:38:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:33,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:38:33,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:38:33,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:33,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:33,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:33,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:33,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:38:33,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:38:34,081 INFO L356 Elim1Store]: treesize reduction 190, result has 12.8 percent of original size [2022-07-20 22:38:34,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 38 [2022-07-20 22:38:34,483 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-20 22:38:34,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-20 22:38:34,985 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:38:34,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 23 [2022-07-20 22:38:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 22:38:35,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:38:35,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:38:35,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455520984] [2022-07-20 22:38:35,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455520984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:35,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:35,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:38:35,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067674131] [2022-07-20 22:38:35,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:35,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:38:35,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:38:35,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:38:35,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:38:35,015 INFO L87 Difference]: Start difference. First operand 491 states and 731 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-20 22:38:37,043 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-20 22:38:41,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:38:43,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:38:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:46,076 INFO L93 Difference]: Finished difference Result 1122 states and 1671 transitions. [2022-07-20 22:38:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:38:46,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 128 [2022-07-20 22:38:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:46,091 INFO L225 Difference]: With dead ends: 1122 [2022-07-20 22:38:46,091 INFO L226 Difference]: Without dead ends: 641 [2022-07-20 22:38:46,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:38:46,095 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 39 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:46,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 566 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 11.0s Time] [2022-07-20 22:38:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-20 22:38:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 566. [2022-07-20 22:38:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.5221238938053097) internal successors, (860), 565 states have internal predecessors, (860), 0 states have call successors, (0), 0 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-20 22:38:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 860 transitions. [2022-07-20 22:38:46,128 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 860 transitions. Word has length 128 [2022-07-20 22:38:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:46,128 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 860 transitions. [2022-07-20 22:38:46,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-20 22:38:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 860 transitions. [2022-07-20 22:38:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 22:38:46,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:46,132 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, 1] [2022-07-20 22:38:46,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 22:38:46,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:38:46,349 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-20 22:38:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:38:46,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867687022] [2022-07-20 22:38:46,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:46,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:38:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:38:46,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:38:46,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 22:38:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:38:51,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:38:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:38:53,291 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 22:38:53,292 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:38:53,292 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:38:53,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 22:38:53,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:38:53,506 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:38:53,509 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:38:53,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:38:53 BoogieIcfgContainer [2022-07-20 22:38:53,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:38:53,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:38:53,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:38:53,655 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:38:53,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:38:14" (3/4) ... [2022-07-20 22:38:53,656 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 22:38:53,796 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 22:38:53,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:38:53,796 INFO L158 Benchmark]: Toolchain (without parser) took 48760.42ms. Allocated memory was 56.6MB in the beginning and 113.2MB in the end (delta: 56.6MB). Free memory was 38.7MB in the beginning and 65.0MB in the end (delta: -26.3MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2022-07-20 22:38:53,797 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.2MB in the beginning and 28.2MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:38:53,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.20ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 30.2MB in the end (delta: 8.3MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2022-07-20 22:38:53,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.38ms. Allocated memory is still 56.6MB. Free memory was 30.1MB in the beginning and 25.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 22:38:53,798 INFO L158 Benchmark]: Boogie Preprocessor took 81.38ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 25.4MB in the beginning and 44.5MB in the end (delta: -19.1MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-07-20 22:38:53,798 INFO L158 Benchmark]: RCFGBuilder took 8389.95ms. Allocated memory is still 73.4MB. Free memory was 44.5MB in the beginning and 26.2MB in the end (delta: 18.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2022-07-20 22:38:53,799 INFO L158 Benchmark]: TraceAbstraction took 39267.89ms. Allocated memory was 73.4MB in the beginning and 113.2MB in the end (delta: 39.8MB). Free memory was 25.7MB in the beginning and 39.2MB in the end (delta: -13.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-07-20 22:38:53,799 INFO L158 Benchmark]: Witness Printer took 141.77ms. Allocated memory is still 113.2MB. Free memory was 39.2MB in the beginning and 65.0MB in the end (delta: -25.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-07-20 22:38:53,805 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 46.1MB. Free memory was 28.2MB in the beginning and 28.2MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.20ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 30.2MB in the end (delta: 8.3MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.38ms. Allocated memory is still 56.6MB. Free memory was 30.1MB in the beginning and 25.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.38ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 25.4MB in the beginning and 44.5MB in the end (delta: -19.1MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * RCFGBuilder took 8389.95ms. Allocated memory is still 73.4MB. Free memory was 44.5MB in the beginning and 26.2MB in the end (delta: 18.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 39267.89ms. Allocated memory was 73.4MB in the beginning and 113.2MB in the end (delta: 39.8MB). Free memory was 25.7MB in the beginning and 39.2MB in the end (delta: -13.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 141.77ms. Allocated memory is still 113.2MB. Free memory was 39.2MB in the beginning and 65.0MB in the end (delta: -25.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 1737]: 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->cert={6:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=0, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1383] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___9=2147483648] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1618] COND TRUE blastFlag == 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1737] reach_error() VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 22.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 3347 SdHoareTripleChecker+Invalid, 21.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1789 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=6, InterpolantAutomatonStates: 22, 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, 6 MinimizatonAttempts, 75 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 1718 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4568 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 359/359 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-20 22:38:53,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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