./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.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 c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:02:12,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:02:12,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:02:12,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:02:12,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:02:12,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:02:12,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:02:12,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:02:12,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:02:12,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:02:12,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:02:12,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:02:12,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:02:12,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:02:12,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:02:12,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:02:12,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:02:12,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:02:12,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:02:12,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:02:12,391 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:02:12,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:02:12,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:02:12,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:02:12,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:02:12,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:02:12,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:02:12,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:02:12,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:02:12,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:02:12,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:02:12,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:02:12,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:02:12,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:02:12,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:02:12,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:02:12,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:02:12,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:02:12,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:02:12,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:02:12,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:02:12,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:02:12,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 11:02:12,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:02:12,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:02:12,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:02:12,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:02:12,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:02:12,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:02:12,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:02:12,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:02:12,429 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:02:12,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:02:12,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:02:12,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 11:02:12,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:02:12,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:02:12,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:02:12,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:02:12,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:02:12,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:02:12,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:02:12,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:02:12,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:02:12,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 11:02:12,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 11:02:12,433 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:02:12,433 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:02:12,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:02:12,434 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 -> c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 [2022-07-19 11:02:12,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:02:12,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:02:12,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:02:12,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:02:12,677 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:02:12,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-19 11:02:12,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c55f8c18/cbeead1aa1934be0a6f84a79324a4570/FLAGd403355e6 [2022-07-19 11:02:13,166 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:02:13,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-19 11:02:13,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c55f8c18/cbeead1aa1934be0a6f84a79324a4570/FLAGd403355e6 [2022-07-19 11:02:13,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c55f8c18/cbeead1aa1934be0a6f84a79324a4570 [2022-07-19 11:02:13,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:02:13,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:02:13,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:02:13,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:02:13,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:02:13,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472ce247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13, skipping insertion in model container [2022-07-19 11:02:13,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:02:13,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:02:13,526 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.03.i.cil.c[72493,72506] [2022-07-19 11:02:13,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:02:13,562 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:02:13,642 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.03.i.cil.c[72493,72506] [2022-07-19 11:02:13,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:02:13,656 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:02:13,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13 WrapperNode [2022-07-19 11:02:13,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:02:13,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:02:13,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:02:13,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:02:13,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,708 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 782 [2022-07-19 11:02:13,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:02:13,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:02:13,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:02:13,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:02:13,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:02:13,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:02:13,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:02:13,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:02:13,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (1/1) ... [2022-07-19 11:02:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:02:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:02:13,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 11:02:13,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 11:02:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:02:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:02:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 11:02:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 11:02:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:02:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 11:02:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:02:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:02:13,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:02:13,993 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:02:13,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:02:14,005 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:02:16,718 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:02:16,719 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:02:16,719 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:02:16,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:02:16,728 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:02:16,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:16 BoogieIcfgContainer [2022-07-19 11:02:16,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:02:16,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:02:16,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:02:16,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:02:16,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:02:13" (1/3) ... [2022-07-19 11:02:16,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618d7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:16, skipping insertion in model container [2022-07-19 11:02:16,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:13" (2/3) ... [2022-07-19 11:02:16,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618d7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:16, skipping insertion in model container [2022-07-19 11:02:16,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:16" (3/3) ... [2022-07-19 11:02:16,738 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-07-19 11:02:16,748 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:02:16,748 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:02:16,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:02:16,812 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@262df192, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74e33952 [2022-07-19 11:02:16,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:02:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 11:02:16,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:16,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:16,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2022-07-19 11:02:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:16,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279773161] [2022-07-19 11:02:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279773161] [2022-07-19 11:02:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279773161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:17,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:17,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198592016] [2022-07-19 11:02:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:17,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:17,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:17,260 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:18,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:18,858 INFO L93 Difference]: Finished difference Result 406 states and 687 transitions. [2022-07-19 11:02:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:18,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-19 11:02:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:18,868 INFO L225 Difference]: With dead ends: 406 [2022-07-19 11:02:18,868 INFO L226 Difference]: Without dead ends: 246 [2022-07-19 11:02:18,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:18,872 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 142 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 411 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:18,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 411 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 11:02:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-19 11:02:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 175. [2022-07-19 11:02:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.6091954022988506) internal successors, (280), 174 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2022-07-19 11:02:18,903 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 47 [2022-07-19 11:02:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:18,904 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2022-07-19 11:02:18,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2022-07-19 11:02:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 11:02:18,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:18,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:18,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 11:02:18,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1376830255, now seen corresponding path program 1 times [2022-07-19 11:02:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:18,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213513581] [2022-07-19 11:02:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213513581] [2022-07-19 11:02:19,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213513581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:19,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:19,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350970707] [2022-07-19 11:02:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:19,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:19,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:19,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:19,015 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:21,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:21,224 INFO L93 Difference]: Finished difference Result 368 states and 587 transitions. [2022-07-19 11:02:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-19 11:02:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:21,226 INFO L225 Difference]: With dead ends: 368 [2022-07-19 11:02:21,226 INFO L226 Difference]: Without dead ends: 203 [2022-07-19 11:02:21,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:21,228 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:21,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 439 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-19 11:02:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-19 11:02:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6162162162162161) internal successors, (299), 185 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 299 transitions. [2022-07-19 11:02:21,246 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 299 transitions. Word has length 48 [2022-07-19 11:02:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:21,246 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 299 transitions. [2022-07-19 11:02:21,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 299 transitions. [2022-07-19 11:02:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 11:02:21,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:21,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:21,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 11:02:21,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2069426656, now seen corresponding path program 1 times [2022-07-19 11:02:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:21,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903082995] [2022-07-19 11:02:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:21,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903082995] [2022-07-19 11:02:21,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903082995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:21,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:21,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924716192] [2022-07-19 11:02:21,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:21,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:21,356 INFO L87 Difference]: Start difference. First operand 186 states and 299 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:23,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:23,541 INFO L93 Difference]: Finished difference Result 368 states and 586 transitions. [2022-07-19 11:02:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:23,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-19 11:02:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:23,543 INFO L225 Difference]: With dead ends: 368 [2022-07-19 11:02:23,543 INFO L226 Difference]: Without dead ends: 203 [2022-07-19 11:02:23,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:23,544 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 24 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:23,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 441 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-19 11:02:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-19 11:02:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6108108108108108) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-07-19 11:02:23,550 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 298 transitions. Word has length 61 [2022-07-19 11:02:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:23,550 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-19 11:02:23,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-07-19 11:02:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:23,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:23,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 11:02:23,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2105609775, now seen corresponding path program 1 times [2022-07-19 11:02:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:23,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855439247] [2022-07-19 11:02:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855439247] [2022-07-19 11:02:23,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855439247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:23,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:23,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095795612] [2022-07-19 11:02:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:23,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:23,666 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:25,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:25,868 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-07-19 11:02:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-19 11:02:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:25,869 INFO L225 Difference]: With dead ends: 367 [2022-07-19 11:02:25,869 INFO L226 Difference]: Without dead ends: 202 [2022-07-19 11:02:25,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:25,870 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 28 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:25,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-19 11:02:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-19 11:02:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6054054054054054) internal successors, (297), 185 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 297 transitions. [2022-07-19 11:02:25,876 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 297 transitions. Word has length 62 [2022-07-19 11:02:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:25,876 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 297 transitions. [2022-07-19 11:02:25,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 297 transitions. [2022-07-19 11:02:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:25,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:25,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:25,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 11:02:25,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1980827365, now seen corresponding path program 1 times [2022-07-19 11:02:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:25,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709354446] [2022-07-19 11:02:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:25,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709354446] [2022-07-19 11:02:25,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709354446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:25,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:25,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881701411] [2022-07-19 11:02:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:25,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:25,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:25,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:25,969 INFO L87 Difference]: Start difference. First operand 186 states and 297 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:27,157 INFO L93 Difference]: Finished difference Result 367 states and 583 transitions. [2022-07-19 11:02:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-19 11:02:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:27,158 INFO L225 Difference]: With dead ends: 367 [2022-07-19 11:02:27,158 INFO L226 Difference]: Without dead ends: 202 [2022-07-19 11:02:27,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:27,159 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 26 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:27,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 11:02:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-19 11:02:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-19 11:02:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 296 transitions. [2022-07-19 11:02:27,168 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 296 transitions. Word has length 62 [2022-07-19 11:02:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:27,171 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 296 transitions. [2022-07-19 11:02:27,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 296 transitions. [2022-07-19 11:02:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:27,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:27,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:27,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 11:02:27,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:27,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash 159955684, now seen corresponding path program 1 times [2022-07-19 11:02:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:27,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703921365] [2022-07-19 11:02:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:27,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703921365] [2022-07-19 11:02:27,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703921365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:27,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:27,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712595078] [2022-07-19 11:02:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:27,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:27,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:27,296 INFO L87 Difference]: Start difference. First operand 186 states and 296 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:29,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:29,487 INFO L93 Difference]: Finished difference Result 366 states and 581 transitions. [2022-07-19 11:02:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:29,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-19 11:02:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:29,489 INFO L225 Difference]: With dead ends: 366 [2022-07-19 11:02:29,489 INFO L226 Difference]: Without dead ends: 201 [2022-07-19 11:02:29,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:29,490 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 19 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:29,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 445 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-19 11:02:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2022-07-19 11:02:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5945945945945945) internal successors, (295), 185 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 295 transitions. [2022-07-19 11:02:29,493 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 295 transitions. Word has length 62 [2022-07-19 11:02:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:29,493 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 295 transitions. [2022-07-19 11:02:29,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 295 transitions. [2022-07-19 11:02:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:29,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:29,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:29,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 11:02:29,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash 794933796, now seen corresponding path program 1 times [2022-07-19 11:02:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:29,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170080356] [2022-07-19 11:02:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:29,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:29,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170080356] [2022-07-19 11:02:29,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170080356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:29,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:29,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782447975] [2022-07-19 11:02:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:29,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:29,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:29,603 INFO L87 Difference]: Start difference. First operand 186 states and 295 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:31,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:31,831 INFO L93 Difference]: Finished difference Result 364 states and 578 transitions. [2022-07-19 11:02:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:31,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-19 11:02:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:31,832 INFO L225 Difference]: With dead ends: 364 [2022-07-19 11:02:31,832 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 11:02:31,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:31,833 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:31,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 11:02:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-19 11:02:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5891891891891892) internal successors, (294), 185 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 294 transitions. [2022-07-19 11:02:31,837 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 294 transitions. Word has length 62 [2022-07-19 11:02:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:31,837 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 294 transitions. [2022-07-19 11:02:31,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 294 transitions. [2022-07-19 11:02:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 11:02:31,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:31,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:31,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 11:02:31,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1302432407, now seen corresponding path program 1 times [2022-07-19 11:02:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:31,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126976575] [2022-07-19 11:02:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:31,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:31,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126976575] [2022-07-19 11:02:31,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126976575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:31,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:31,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393260126] [2022-07-19 11:02:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:31,906 INFO L87 Difference]: Start difference. First operand 186 states and 294 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:33,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:34,090 INFO L93 Difference]: Finished difference Result 364 states and 577 transitions. [2022-07-19 11:02:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:34,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-19 11:02:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:34,091 INFO L225 Difference]: With dead ends: 364 [2022-07-19 11:02:34,091 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 11:02:34,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:34,092 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 22 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:34,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 11:02:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-19 11:02:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5837837837837838) internal successors, (293), 185 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2022-07-19 11:02:34,096 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 63 [2022-07-19 11:02:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:34,096 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2022-07-19 11:02:34,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2022-07-19 11:02:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 11:02:34,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:34,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:34,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 11:02:34,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1198430410, now seen corresponding path program 1 times [2022-07-19 11:02:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:34,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020881605] [2022-07-19 11:02:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:34,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020881605] [2022-07-19 11:02:34,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020881605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:34,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:34,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356307084] [2022-07-19 11:02:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:34,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:34,190 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:36,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:36,377 INFO L93 Difference]: Finished difference Result 364 states and 576 transitions. [2022-07-19 11:02:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-19 11:02:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:36,378 INFO L225 Difference]: With dead ends: 364 [2022-07-19 11:02:36,378 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 11:02:36,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:36,379 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 20 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:36,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 11:02:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-19 11:02:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 185 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 292 transitions. [2022-07-19 11:02:36,386 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 292 transitions. Word has length 64 [2022-07-19 11:02:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:36,386 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 292 transitions. [2022-07-19 11:02:36,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 292 transitions. [2022-07-19 11:02:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 11:02:36,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:36,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:36,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 11:02:36,391 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:36,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1676500242, now seen corresponding path program 1 times [2022-07-19 11:02:36,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:36,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125204429] [2022-07-19 11:02:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:36,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125204429] [2022-07-19 11:02:36,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125204429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:36,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:36,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158276787] [2022-07-19 11:02:36,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:36,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:36,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:36,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:36,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:36,486 INFO L87 Difference]: Start difference. First operand 186 states and 292 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:38,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:38,645 INFO L93 Difference]: Finished difference Result 354 states and 562 transitions. [2022-07-19 11:02:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-19 11:02:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:38,646 INFO L225 Difference]: With dead ends: 354 [2022-07-19 11:02:38,646 INFO L226 Difference]: Without dead ends: 189 [2022-07-19 11:02:38,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-19 11:02:38,647 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:38,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 463 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:02:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-19 11:02:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-07-19 11:02:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.572972972972973) internal successors, (291), 185 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2022-07-19 11:02:38,653 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 65 [2022-07-19 11:02:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:38,654 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2022-07-19 11:02:38,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2022-07-19 11:02:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 11:02:38,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:38,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:38,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 11:02:38,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1196291754, now seen corresponding path program 1 times [2022-07-19 11:02:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:38,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494985463] [2022-07-19 11:02:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494985463] [2022-07-19 11:02:38,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494985463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:38,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:38,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476500516] [2022-07-19 11:02:38,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:38,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:38,756 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:40,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:41,062 INFO L93 Difference]: Finished difference Result 465 states and 733 transitions. [2022-07-19 11:02:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:41,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-19 11:02:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:41,064 INFO L225 Difference]: With dead ends: 465 [2022-07-19 11:02:41,064 INFO L226 Difference]: Without dead ends: 298 [2022-07-19 11:02:41,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:41,066 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 111 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:41,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 312 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-19 11:02:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 228. [2022-07-19 11:02:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6255506607929515) internal successors, (369), 227 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2022-07-19 11:02:41,070 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 65 [2022-07-19 11:02:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:41,071 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2022-07-19 11:02:41,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2022-07-19 11:02:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 11:02:41,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:41,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:41,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 11:02:41,071 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:41,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash -103652171, now seen corresponding path program 1 times [2022-07-19 11:02:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:41,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730727270] [2022-07-19 11:02:41,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730727270] [2022-07-19 11:02:41,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730727270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:41,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:41,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:41,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086592717] [2022-07-19 11:02:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:41,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:41,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:41,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:41,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:41,185 INFO L87 Difference]: Start difference. First operand 228 states and 369 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:43,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:43,498 INFO L93 Difference]: Finished difference Result 544 states and 881 transitions. [2022-07-19 11:02:43,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:43,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-19 11:02:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:43,500 INFO L225 Difference]: With dead ends: 544 [2022-07-19 11:02:43,501 INFO L226 Difference]: Without dead ends: 337 [2022-07-19 11:02:43,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:43,502 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 119 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:43,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-19 11:02:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 260. [2022-07-19 11:02:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.6447876447876448) internal successors, (426), 259 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 426 transitions. [2022-07-19 11:02:43,512 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 426 transitions. Word has length 93 [2022-07-19 11:02:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:43,514 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 426 transitions. [2022-07-19 11:02:43,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 426 transitions. [2022-07-19 11:02:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 11:02:43,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:43,520 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:43,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 11:02:43,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash -430845807, now seen corresponding path program 1 times [2022-07-19 11:02:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:43,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606655353] [2022-07-19 11:02:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606655353] [2022-07-19 11:02:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606655353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:43,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:43,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101098946] [2022-07-19 11:02:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:43,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:43,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:43,645 INFO L87 Difference]: Start difference. First operand 260 states and 426 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:45,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:45,602 INFO L93 Difference]: Finished difference Result 613 states and 1000 transitions. [2022-07-19 11:02:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-19 11:02:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:45,604 INFO L225 Difference]: With dead ends: 613 [2022-07-19 11:02:45,604 INFO L226 Difference]: Without dead ends: 374 [2022-07-19 11:02:45,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:45,604 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:45,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 318 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 11:02:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-19 11:02:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 303. [2022-07-19 11:02:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.6622516556291391) internal successors, (502), 302 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 502 transitions. [2022-07-19 11:02:45,615 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 502 transitions. Word has length 105 [2022-07-19 11:02:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:45,615 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 502 transitions. [2022-07-19 11:02:45,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 502 transitions. [2022-07-19 11:02:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:02:45,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:45,618 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:45,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 11:02:45,619 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 827966928, now seen corresponding path program 1 times [2022-07-19 11:02:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:45,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131274810] [2022-07-19 11:02:45,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:45,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131274810] [2022-07-19 11:02:45,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131274810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:45,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:45,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900254254] [2022-07-19 11:02:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:45,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:45,695 INFO L87 Difference]: Start difference. First operand 303 states and 502 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:47,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:47,982 INFO L93 Difference]: Finished difference Result 697 states and 1149 transitions. [2022-07-19 11:02:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:02:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:47,984 INFO L225 Difference]: With dead ends: 697 [2022-07-19 11:02:47,984 INFO L226 Difference]: Without dead ends: 415 [2022-07-19 11:02:47,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:47,985 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 136 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:47,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 302 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-19 11:02:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 319. [2022-07-19 11:02:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.650943396226415) internal successors, (525), 318 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 525 transitions. [2022-07-19 11:02:47,990 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 525 transitions. Word has length 106 [2022-07-19 11:02:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:47,990 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 525 transitions. [2022-07-19 11:02:47,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 525 transitions. [2022-07-19 11:02:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:02:47,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:47,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:47,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 11:02:47,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash -421532676, now seen corresponding path program 1 times [2022-07-19 11:02:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:47,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636976582] [2022-07-19 11:02:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 11:02:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:48,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636976582] [2022-07-19 11:02:48,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636976582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:48,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:48,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33594955] [2022-07-19 11:02:48,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:48,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:48,085 INFO L87 Difference]: Start difference. First operand 319 states and 525 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:49,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:49,477 INFO L93 Difference]: Finished difference Result 660 states and 1090 transitions. [2022-07-19 11:02:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:49,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:02:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:49,478 INFO L225 Difference]: With dead ends: 660 [2022-07-19 11:02:49,478 INFO L226 Difference]: Without dead ends: 362 [2022-07-19 11:02:49,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:49,479 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 33 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:49,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 461 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 11:02:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-19 11:02:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-07-19 11:02:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6529411764705881) internal successors, (562), 340 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 562 transitions. [2022-07-19 11:02:49,484 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 562 transitions. Word has length 106 [2022-07-19 11:02:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:49,484 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 562 transitions. [2022-07-19 11:02:49,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 562 transitions. [2022-07-19 11:02:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 11:02:49,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:49,485 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:49,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 11:02:49,486 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1425787158, now seen corresponding path program 1 times [2022-07-19 11:02:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:49,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831382978] [2022-07-19 11:02:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831382978] [2022-07-19 11:02:49,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831382978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:49,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:49,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:49,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822281657] [2022-07-19 11:02:49,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:49,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:49,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:49,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:49,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:49,555 INFO L87 Difference]: Start difference. First operand 341 states and 562 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:51,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:51,395 INFO L93 Difference]: Finished difference Result 731 states and 1193 transitions. [2022-07-19 11:02:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-19 11:02:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:51,397 INFO L225 Difference]: With dead ends: 731 [2022-07-19 11:02:51,397 INFO L226 Difference]: Without dead ends: 411 [2022-07-19 11:02:51,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:51,398 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 135 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:51,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 11:02:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-07-19 11:02:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 341. [2022-07-19 11:02:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.638235294117647) internal successors, (557), 340 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 557 transitions. [2022-07-19 11:02:51,404 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 557 transitions. Word has length 107 [2022-07-19 11:02:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:51,405 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 557 transitions. [2022-07-19 11:02:51,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 557 transitions. [2022-07-19 11:02:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 11:02:51,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:51,406 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:51,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 11:02:51,406 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -778017264, now seen corresponding path program 1 times [2022-07-19 11:02:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:51,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378398267] [2022-07-19 11:02:51,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:51,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:51,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378398267] [2022-07-19 11:02:51,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378398267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:51,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:51,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989921667] [2022-07-19 11:02:51,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:51,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:51,480 INFO L87 Difference]: Start difference. First operand 341 states and 557 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:53,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:53,650 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2022-07-19 11:02:53,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:53,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-19 11:02:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:53,652 INFO L225 Difference]: With dead ends: 730 [2022-07-19 11:02:53,652 INFO L226 Difference]: Without dead ends: 410 [2022-07-19 11:02:53,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:53,653 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 140 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:53,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-19 11:02:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-19 11:02:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6205882352941177) internal successors, (551), 340 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 551 transitions. [2022-07-19 11:02:53,658 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 551 transitions. Word has length 120 [2022-07-19 11:02:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:53,658 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 551 transitions. [2022-07-19 11:02:53,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 551 transitions. [2022-07-19 11:02:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 11:02:53,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:53,659 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:53,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 11:02:53,660 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 934196388, now seen corresponding path program 1 times [2022-07-19 11:02:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:53,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588277192] [2022-07-19 11:02:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:53,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588277192] [2022-07-19 11:02:53,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588277192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:53,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:53,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006636851] [2022-07-19 11:02:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:53,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:53,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:53,730 INFO L87 Difference]: Start difference. First operand 341 states and 551 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:54,538 INFO L93 Difference]: Finished difference Result 730 states and 1170 transitions. [2022-07-19 11:02:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:54,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-19 11:02:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:54,540 INFO L225 Difference]: With dead ends: 730 [2022-07-19 11:02:54,540 INFO L226 Difference]: Without dead ends: 410 [2022-07-19 11:02:54,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:54,541 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 138 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:54,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 304 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 11:02:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-19 11:02:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-19 11:02:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6029411764705883) internal successors, (545), 340 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 545 transitions. [2022-07-19 11:02:54,546 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 545 transitions. Word has length 120 [2022-07-19 11:02:54,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:54,546 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 545 transitions. [2022-07-19 11:02:54,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 545 transitions. [2022-07-19 11:02:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 11:02:54,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:54,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:54,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 11:02:54,548 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 691990311, now seen corresponding path program 1 times [2022-07-19 11:02:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:54,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562161550] [2022-07-19 11:02:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 11:02:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:54,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562161550] [2022-07-19 11:02:54,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562161550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:54,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:54,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349189062] [2022-07-19 11:02:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:54,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:54,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:54,636 INFO L87 Difference]: Start difference. First operand 341 states and 545 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:56,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:56,818 INFO L93 Difference]: Finished difference Result 678 states and 1088 transitions. [2022-07-19 11:02:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:56,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-19 11:02:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:56,819 INFO L225 Difference]: With dead ends: 678 [2022-07-19 11:02:56,820 INFO L226 Difference]: Without dead ends: 358 [2022-07-19 11:02:56,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:56,820 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:56,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-19 11:02:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-19 11:02:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6) internal successors, (544), 340 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 544 transitions. [2022-07-19 11:02:56,825 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 544 transitions. Word has length 120 [2022-07-19 11:02:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:56,825 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 544 transitions. [2022-07-19 11:02:56,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 544 transitions. [2022-07-19 11:02:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 11:02:56,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:56,826 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:56,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 11:02:56,827 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1061009666, now seen corresponding path program 1 times [2022-07-19 11:02:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:56,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212185902] [2022-07-19 11:02:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:56,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:56,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:56,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212185902] [2022-07-19 11:02:56,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212185902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:56,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:56,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:56,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281414146] [2022-07-19 11:02:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:56,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:56,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:56,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:56,929 INFO L87 Difference]: Start difference. First operand 341 states and 544 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:57,830 INFO L93 Difference]: Finished difference Result 678 states and 1086 transitions. [2022-07-19 11:02:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-19 11:02:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:57,832 INFO L225 Difference]: With dead ends: 678 [2022-07-19 11:02:57,832 INFO L226 Difference]: Without dead ends: 358 [2022-07-19 11:02:57,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:57,832 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 37 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:57,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 11:02:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-19 11:02:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-19 11:02:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5970588235294119) internal successors, (543), 340 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 543 transitions. [2022-07-19 11:02:57,837 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 543 transitions. Word has length 121 [2022-07-19 11:02:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:57,837 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 543 transitions. [2022-07-19 11:02:57,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 543 transitions. [2022-07-19 11:02:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 11:02:57,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:57,838 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:57,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 11:02:57,838 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash 955624361, now seen corresponding path program 1 times [2022-07-19 11:02:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:57,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902185096] [2022-07-19 11:02:57,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:02:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902185096] [2022-07-19 11:02:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902185096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:57,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:57,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133289847] [2022-07-19 11:02:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:57,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:57,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:57,928 INFO L87 Difference]: Start difference. First operand 341 states and 543 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:59,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:00,206 INFO L93 Difference]: Finished difference Result 730 states and 1154 transitions. [2022-07-19 11:03:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:03:00,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-19 11:03:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:00,208 INFO L225 Difference]: With dead ends: 730 [2022-07-19 11:03:00,208 INFO L226 Difference]: Without dead ends: 410 [2022-07-19 11:03:00,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:03:00,209 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 135 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:00,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:03:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-19 11:03:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-19 11:03:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5794117647058823) internal successors, (537), 340 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 537 transitions. [2022-07-19 11:03:00,214 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 537 transitions. Word has length 122 [2022-07-19 11:03:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:00,214 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 537 transitions. [2022-07-19 11:03:00,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 537 transitions. [2022-07-19 11:03:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 11:03:00,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:00,216 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:00,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 11:03:00,216 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1509717981, now seen corresponding path program 1 times [2022-07-19 11:03:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:03:00,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471281631] [2022-07-19 11:03:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:03:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 11:03:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:03:00,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471281631] [2022-07-19 11:03:00,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471281631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:00,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:00,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:03:00,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409261058] [2022-07-19 11:03:00,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:00,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:03:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:03:00,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:03:00,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:03:00,348 INFO L87 Difference]: Start difference. First operand 341 states and 537 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:02,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:02,531 INFO L93 Difference]: Finished difference Result 668 states and 1059 transitions. [2022-07-19 11:03:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:03:02,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-19 11:03:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:02,534 INFO L225 Difference]: With dead ends: 668 [2022-07-19 11:03:02,534 INFO L226 Difference]: Without dead ends: 348 [2022-07-19 11:03:02,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:03:02,535 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 26 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 483 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-19 11:03:02,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 483 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:03:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-19 11:03:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2022-07-19 11:03:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.576470588235294) internal successors, (536), 340 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 536 transitions. [2022-07-19 11:03:02,540 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 536 transitions. Word has length 123 [2022-07-19 11:03:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:02,541 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 536 transitions. [2022-07-19 11:03:02,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 536 transitions. [2022-07-19 11:03:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:02,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:02,542 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 11:03:02,542 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2022-07-19 11:03:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:03:02,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808388537] [2022-07-19 11:03:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:03:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 11:03:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:03:02,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808388537] [2022-07-19 11:03:02,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808388537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:02,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:02,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:03:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697157983] [2022-07-19 11:03:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:02,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:03:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:03:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:03:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:03:02,767 INFO L87 Difference]: Start difference. First operand 341 states and 536 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:04,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:06,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:07,013 INFO L93 Difference]: Finished difference Result 679 states and 1068 transitions. [2022-07-19 11:03:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:03:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-19 11:03:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:07,014 INFO L225 Difference]: With dead ends: 679 [2022-07-19 11:03:07,014 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 11:03:07,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 11:03:07,015 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:07,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 11:03:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 11:03:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-19 11:03:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5735294117647058) internal successors, (535), 340 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 535 transitions. [2022-07-19 11:03:07,019 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 535 transitions. Word has length 127 [2022-07-19 11:03:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:07,020 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 535 transitions. [2022-07-19 11:03:07,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 535 transitions. [2022-07-19 11:03:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:07,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:07,021 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:07,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 11:03:07,021 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2022-07-19 11:03:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:03:07,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632049733] [2022-07-19 11:03:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:03:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:07,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:03:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:07,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 11:03:07,703 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:03:07,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:03:07,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 11:03:07,711 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:07,714 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:03:07,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:03:07 BoogieIcfgContainer [2022-07-19 11:03:07,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:03:07,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:03:07,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:03:07,881 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:03:07,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:16" (3/4) ... [2022-07-19 11:03:07,883 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 11:03:07,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:03:07,884 INFO L158 Benchmark]: Toolchain (without parser) took 54677.89ms. Allocated memory was 81.8MB in the beginning and 186.6MB in the end (delta: 104.9MB). Free memory was 42.7MB in the beginning and 80.9MB in the end (delta: -38.3MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2022-07-19 11:03:07,884 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 81.8MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:03:07,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.57ms. Allocated memory is still 107.0MB. Free memory was 86.0MB in the beginning and 62.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-19 11:03:07,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.33ms. Allocated memory is still 107.0MB. Free memory was 62.4MB in the beginning and 57.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 11:03:07,885 INFO L158 Benchmark]: Boogie Preprocessor took 77.23ms. Allocated memory is still 107.0MB. Free memory was 57.3MB in the beginning and 50.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 11:03:07,887 INFO L158 Benchmark]: RCFGBuilder took 2943.06ms. Allocated memory is still 107.0MB. Free memory was 50.1MB in the beginning and 42.7MB in the end (delta: 7.4MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-07-19 11:03:07,887 INFO L158 Benchmark]: TraceAbstraction took 51146.71ms. Allocated memory was 107.0MB in the beginning and 186.6MB in the end (delta: 79.7MB). Free memory was 42.2MB in the beginning and 80.9MB in the end (delta: -38.8MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2022-07-19 11:03:07,888 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 186.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:03:07,889 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 81.8MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.57ms. Allocated memory is still 107.0MB. Free memory was 86.0MB in the beginning and 62.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.33ms. Allocated memory is still 107.0MB. Free memory was 62.4MB in the beginning and 57.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.23ms. Allocated memory is still 107.0MB. Free memory was 57.3MB in the beginning and 50.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2943.06ms. Allocated memory is still 107.0MB. Free memory was 50.1MB in the beginning and 42.7MB in the end (delta: 7.4MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 51146.71ms. Allocated memory was 107.0MB in the beginning and 186.6MB in the end (delta: 79.7MB). Free memory was 42.2MB in the beginning and 80.9MB in the end (delta: -38.8MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 186.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1734]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->info_callback={0:-12}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-12}, blastFlag=1, got_new_session=0, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1388] s->init_num = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1606] COND FALSE !(! tmp___10) VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1734] reach_error() VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.9s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 46.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1494 mSDsluCounter, 9447 SdHoareTripleChecker+Invalid, 45.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5867 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4424 IncrementalHoareTripleChecker+Invalid, 5054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 3580 mSDtfsCounter, 4424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 847 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2008 ConstructedInterpolants, 0 QuantifiedInterpolants, 4903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1128/1128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 11:03:07,922 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.03.i.cil.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 c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:03:09,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:03:09,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:03:09,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:03:09,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:03:09,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:03:09,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:03:09,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:03:09,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:03:09,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:03:09,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:03:09,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:03:09,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:03:09,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:03:09,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:03:09,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:03:09,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:03:09,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:03:09,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:03:09,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:03:09,713 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:03:09,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:03:09,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:03:09,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:03:09,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:03:09,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:03:09,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:03:09,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:03:09,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:03:09,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:03:09,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:03:09,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:03:09,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:03:09,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:03:09,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:03:09,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:03:09,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:03:09,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:03:09,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:03:09,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:03:09,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:03:09,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:03:09,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 11:03:09,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:03:09,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:03:09,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:03:09,761 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:03:09,761 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:03:09,761 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:03:09,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:03:09,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:03:09,762 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:03:09,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:03:09,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:03:09,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:03:09,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:03:09,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:03:09,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:03:09,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:03:09,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:03:09,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:03:09,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:03:09,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:03:09,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:03:09,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:03:09,770 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 11:03:09,770 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 11:03:09,770 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:03:09,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:03:09,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:03:09,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 11:03:09,771 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 -> c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 [2022-07-19 11:03:10,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:03:10,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:03:10,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:03:10,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:03:10,054 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:03:10,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-19 11:03:10,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed7315b2/8730a7b25356473cb035da165b7ab1b9/FLAG1f294a3cf [2022-07-19 11:03:10,524 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:03:10,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-19 11:03:10,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed7315b2/8730a7b25356473cb035da165b7ab1b9/FLAG1f294a3cf [2022-07-19 11:03:10,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed7315b2/8730a7b25356473cb035da165b7ab1b9 [2022-07-19 11:03:10,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:03:10,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:03:10,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:03:10,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:03:10,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:03:10,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:03:10" (1/1) ... [2022-07-19 11:03:10,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a855e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:10, skipping insertion in model container [2022-07-19 11:03:10,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:03:10" (1/1) ... [2022-07-19 11:03:10,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:03:10,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:03:10,958 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.03.i.cil.c[72493,72506] [2022-07-19 11:03:10,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:10,985 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 11:03:10,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:03:11,062 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.03.i.cil.c[72493,72506] [2022-07-19 11:03:11,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:11,068 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:03:11,122 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.03.i.cil.c[72493,72506] [2022-07-19 11:03:11,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:11,141 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:03:11,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11 WrapperNode [2022-07-19 11:03:11,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:03:11,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:03:11,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:03:11,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:03:11,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,230 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 752 [2022-07-19 11:03:11,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:03:11,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:03:11,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:03:11,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:03:11,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:03:11,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:03:11,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:03:11,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:03:11,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (1/1) ... [2022-07-19 11:03:11,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:03:11,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:03:11,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 11:03:11,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 11:03:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:03:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 11:03:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:03:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 11:03:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:03:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:03:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:03:11,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:03:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 11:03:11,515 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:03:11,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:03:11,554 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:03:18,825 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:03:18,825 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:03:18,825 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:03:18,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:03:18,830 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:03:18,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:18 BoogieIcfgContainer [2022-07-19 11:03:18,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:03:18,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:03:18,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:03:18,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:03:18,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:03:10" (1/3) ... [2022-07-19 11:03:18,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65666fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:18, skipping insertion in model container [2022-07-19 11:03:18,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:11" (2/3) ... [2022-07-19 11:03:18,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65666fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:18, skipping insertion in model container [2022-07-19 11:03:18,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:18" (3/3) ... [2022-07-19 11:03:18,840 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-07-19 11:03:18,850 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:03:18,850 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:03:18,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:03:18,912 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@6b005c01, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75936d3d [2022-07-19 11:03:18,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:03:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 11:03:18,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:18,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:18,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:18,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2022-07-19 11:03:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:18,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034865776] [2022-07-19 11:03:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:18,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:18,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:18,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:18,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 11:03:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:19,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:19,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:03:19,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:19,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:19,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034865776] [2022-07-19 11:03:19,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034865776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:19,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:19,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611517180] [2022-07-19 11:03:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:19,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:19,561 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:19,640 INFO L93 Difference]: Finished difference Result 412 states and 698 transitions. [2022-07-19 11:03:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-19 11:03:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:19,653 INFO L225 Difference]: With dead ends: 412 [2022-07-19 11:03:19,653 INFO L226 Difference]: Without dead ends: 251 [2022-07-19 11:03:19,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:19,663 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 186 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:19,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 456 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:03:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-19 11:03:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-07-19 11:03:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.516) internal successors, (379), 250 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2022-07-19 11:03:19,703 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 47 [2022-07-19 11:03:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:19,703 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2022-07-19 11:03:19,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2022-07-19 11:03:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 11:03:19,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:19,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:19,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:19,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:19,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:19,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1008654101, now seen corresponding path program 1 times [2022-07-19 11:03:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:19,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390532330] [2022-07-19 11:03:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:19,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:19,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:19,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:19,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 11:03:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:20,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:20,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:03:20,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:20,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:20,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390532330] [2022-07-19 11:03:20,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390532330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:20,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:20,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409459722] [2022-07-19 11:03:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:20,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:20,514 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:20,594 INFO L93 Difference]: Finished difference Result 490 states and 746 transitions. [2022-07-19 11:03:20,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:20,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-19 11:03:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:20,596 INFO L225 Difference]: With dead ends: 490 [2022-07-19 11:03:20,596 INFO L226 Difference]: Without dead ends: 368 [2022-07-19 11:03:20,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:20,598 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:20,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 557 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:03:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-19 11:03:20,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-07-19 11:03:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.5122615803814714) internal successors, (555), 367 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2022-07-19 11:03:20,613 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 64 [2022-07-19 11:03:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:20,613 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2022-07-19 11:03:20,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2022-07-19 11:03:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 11:03:20,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:20,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:20,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:20,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:20,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:20,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1548644719, now seen corresponding path program 1 times [2022-07-19 11:03:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279667232] [2022-07-19 11:03:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:20,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:20,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:20,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:20,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 11:03:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:21,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:21,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:03:21,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:21,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:21,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279667232] [2022-07-19 11:03:21,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279667232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:21,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:21,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995993252] [2022-07-19 11:03:21,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:21,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:21,411 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:21,483 INFO L93 Difference]: Finished difference Result 725 states and 1100 transitions. [2022-07-19 11:03:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-19 11:03:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:21,485 INFO L225 Difference]: With dead ends: 725 [2022-07-19 11:03:21,485 INFO L226 Difference]: Without dead ends: 486 [2022-07-19 11:03:21,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:21,486 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:21,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 561 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:03:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-19 11:03:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-07-19 11:03:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.511340206185567) internal successors, (733), 485 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 733 transitions. [2022-07-19 11:03:21,497 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 733 transitions. Word has length 86 [2022-07-19 11:03:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:21,498 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 733 transitions. [2022-07-19 11:03:21,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 733 transitions. [2022-07-19 11:03:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:21,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:21,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:21,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-19 11:03:21,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:21,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2022-07-19 11:03:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:21,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522777148] [2022-07-19 11:03:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:21,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:21,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 11:03:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:22,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 11:03:22,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:22,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 11:03:22,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 11:03:23,122 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-19 11:03:23,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 58 treesize of output 85 [2022-07-19 11:03:23,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2022-07-19 11:03:23,313 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-19 11:03:23,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-19 11:03:23,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:23,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-19 11:03:23,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 11:03:23,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 11:03:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 11:03:23,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:23,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:23,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522777148] [2022-07-19 11:03:23,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522777148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:23,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:23,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:03:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749455699] [2022-07-19 11:03:23,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:23,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:03:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:03:23,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:03:23,378 INFO L87 Difference]: Start difference. First operand 486 states and 733 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:25,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:27,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:29,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:35,022 INFO L93 Difference]: Finished difference Result 969 states and 1462 transitions. [2022-07-19 11:03:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:03:35,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-19 11:03:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:35,025 INFO L225 Difference]: With dead ends: 969 [2022-07-19 11:03:35,025 INFO L226 Difference]: Without dead ends: 486 [2022-07-19 11:03:35,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 11:03:35,027 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:35,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2022-07-19 11:03:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-19 11:03:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-07-19 11:03:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.5092783505154639) internal successors, (732), 485 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 732 transitions. [2022-07-19 11:03:35,035 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 732 transitions. Word has length 127 [2022-07-19 11:03:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:35,036 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 732 transitions. [2022-07-19 11:03:35,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 732 transitions. [2022-07-19 11:03:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:35,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:35,039 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:35,065 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-19 11:03:35,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:35,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2022-07-19 11:03:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:35,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276550123] [2022-07-19 11:03:35,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:35,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:35,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:35,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:35,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 11:03:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:38,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:03:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:40,826 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-19 11:03:40,826 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:03:40,827 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:03:40,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:41,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:41,045 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-19 11:03:41,048 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:03:41,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:03:41 BoogieIcfgContainer [2022-07-19 11:03:41,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:03:41,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:03:41,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:03:41,204 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:03:41,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:18" (3/4) ... [2022-07-19 11:03:41,205 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 11:03:41,272 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 11:03:41,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:03:41,272 INFO L158 Benchmark]: Toolchain (without parser) took 30713.91ms. Allocated memory was 58.7MB in the beginning and 130.0MB in the end (delta: 71.3MB). Free memory was 34.7MB in the beginning and 78.8MB in the end (delta: -44.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-07-19 11:03:41,273 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:03:41,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.61ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.4MB in the beginning and 37.0MB in the end (delta: -2.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-07-19 11:03:41,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.77ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 49.3MB in the end (delta: -12.6MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-07-19 11:03:41,273 INFO L158 Benchmark]: Boogie Preprocessor took 76.35ms. Allocated memory is still 71.3MB. Free memory was 49.3MB in the beginning and 42.1MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 11:03:41,274 INFO L158 Benchmark]: RCFGBuilder took 7521.19ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 41.8MB in the beginning and 60.7MB in the end (delta: -18.9MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2022-07-19 11:03:41,274 INFO L158 Benchmark]: TraceAbstraction took 22356.13ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 59.9MB in the beginning and 94.6MB in the end (delta: -34.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2022-07-19 11:03:41,274 INFO L158 Benchmark]: Witness Printer took 68.92ms. Allocated memory is still 130.0MB. Free memory was 94.6MB in the beginning and 78.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 11:03:41,278 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.14ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.61ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.4MB in the beginning and 37.0MB in the end (delta: -2.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.77ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 49.3MB in the end (delta: -12.6MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.35ms. Allocated memory is still 71.3MB. Free memory was 49.3MB in the beginning and 42.1MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7521.19ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 41.8MB in the beginning and 60.7MB in the end (delta: -18.9MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22356.13ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 59.9MB in the beginning and 94.6MB in the end (delta: -34.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 68.92ms. Allocated memory is still 130.0MB. Free memory was 94.6MB in the beginning and 78.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1734]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->cert={-2147483636:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1388] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1260] COND TRUE s->state == 8656 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1606] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1266] COND TRUE s->state == 8672 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=6, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1734] reach_error() VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=6, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 2205 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1033 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1172 mSDtfsCounter, 211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=486occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 668 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2830 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 153/153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 11:03:41,332 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