./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:39:30,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:39:30,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:39:30,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:39:30,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:39:30,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:39:30,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:39:30,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:39:30,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:39:30,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:39:30,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:39:30,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:39:30,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:39:30,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:39:30,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:39:30,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:39:30,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:39:30,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:39:30,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:39:30,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:39:30,403 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:39:30,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:39:30,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:39:30,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:39:30,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:39:30,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:39:30,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:39:30,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:39:30,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:39:30,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:39:30,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:39:30,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:39:30,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:39:30,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:39:30,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:39:30,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:39:30,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:39:30,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:39:30,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:39:30,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:39:30,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:39:30,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:39:30,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:39:30,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:39:30,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:39:30,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:39:30,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:39:30,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:39:30,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:39:30,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:39:30,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:39:30,453 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:39:30,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:39:30,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:39:30,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:39:30,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:39:30,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:39:30,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:39:30,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:39:30,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:39:30,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:39:30,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:39:30,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:39:30,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:39:30,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:39:30,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:39:30,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:39:30,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:39:30,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:39:30,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:39:30,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:39:30,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:39:30,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:39:30,457 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:39:30,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:39:30,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:39:30,457 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2022-07-20 22:39:30,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:39:30,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:39:30,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:39:30,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:39:30,735 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:39:30,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-20 22:39:30,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989eb0307/f1730d4b73084334950c9d1b1e367a7a/FLAGd9b863735 [2022-07-20 22:39:31,242 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:39:31,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-20 22:39:31,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989eb0307/f1730d4b73084334950c9d1b1e367a7a/FLAGd9b863735 [2022-07-20 22:39:31,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989eb0307/f1730d4b73084334950c9d1b1e367a7a [2022-07-20 22:39:31,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:39:31,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:39:31,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:39:31,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:39:31,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:39:31,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:39:31" (1/1) ... [2022-07-20 22:39:31,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22774bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:31, skipping insertion in model container [2022-07-20 22:39:31,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:39:31" (1/1) ... [2022-07-20 22:39:31,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:39:31,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:39:31,862 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.11.i.cil-1.c[74369,74382] [2022-07-20 22:39:31,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:39:31,879 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:39:31,995 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.11.i.cil-1.c[74369,74382] [2022-07-20 22:39:31,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:39:32,010 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:39:32,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32 WrapperNode [2022-07-20 22:39:32,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:39:32,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:39:32,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:39:32,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:39:32,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,075 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-07-20 22:39:32,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:39:32,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:39:32,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:39:32,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:39:32,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:39:32,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:39:32,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:39:32,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:39:32,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (1/1) ... [2022-07-20 22:39:32,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:39:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:39:32,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 22:39:32,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 22:39:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:39:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:39:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:39:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:39:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:39:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:39:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:39:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:39:32,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:39:32,360 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:39:32,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:39:32,371 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:39:34,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-20 22:39:34,068 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-20 22:39:34,068 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:39:34,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:39:34,073 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:39:34,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:39:34 BoogieIcfgContainer [2022-07-20 22:39:34,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:39:34,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:39:34,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:39:34,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:39:34,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:39:31" (1/3) ... [2022-07-20 22:39:34,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcd0ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:39:34, skipping insertion in model container [2022-07-20 22:39:34,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:39:32" (2/3) ... [2022-07-20 22:39:34,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcd0ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:39:34, skipping insertion in model container [2022-07-20 22:39:34,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:39:34" (3/3) ... [2022-07-20 22:39:34,091 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-07-20 22:39:34,101 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:39:34,101 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:39:34,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:39:34,148 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@c746e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bebb146 [2022-07-20 22:39:34,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:39:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:39:34,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:34,157 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] [2022-07-20 22:39:34,157 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:34,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2022-07-20 22:39:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:34,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065208876] [2022-07-20 22:39:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:34,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065208876] [2022-07-20 22:39:34,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065208876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:34,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:34,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402770389] [2022-07-20 22:39:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:34,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:34,611 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:35,316 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-07-20 22:39:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:35,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-20 22:39:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:35,325 INFO L225 Difference]: With dead ends: 421 [2022-07-20 22:39:35,325 INFO L226 Difference]: Without dead ends: 256 [2022-07-20 22:39:35,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:35,334 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:35,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 22:39:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-20 22:39:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-07-20 22:39:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-07-20 22:39:35,371 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-07-20 22:39:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:35,372 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-07-20 22:39:35,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-07-20 22:39:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 22:39:35,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:35,373 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] [2022-07-20 22:39:35,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:39:35,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591931, now seen corresponding path program 1 times [2022-07-20 22:39:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:35,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919454442] [2022-07-20 22:39:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:35,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919454442] [2022-07-20 22:39:35,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919454442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:35,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:35,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:35,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125677489] [2022-07-20 22:39:35,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:35,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:35,560 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:36,244 INFO L93 Difference]: Finished difference Result 439 states and 692 transitions. [2022-07-20 22:39:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:36,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 22:39:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:36,247 INFO L225 Difference]: With dead ends: 439 [2022-07-20 22:39:36,247 INFO L226 Difference]: Without dead ends: 284 [2022-07-20 22:39:36,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:36,248 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 134 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:36,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 22:39:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-20 22:39:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2022-07-20 22:39:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 312 transitions. [2022-07-20 22:39:36,264 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 312 transitions. Word has length 38 [2022-07-20 22:39:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:36,264 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 312 transitions. [2022-07-20 22:39:36,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 312 transitions. [2022-07-20 22:39:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:39:36,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:36,266 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] [2022-07-20 22:39:36,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:39:36,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:36,267 INFO L85 PathProgramCache]: Analyzing trace with hash 917746377, now seen corresponding path program 1 times [2022-07-20 22:39:36,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:36,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783694973] [2022-07-20 22:39:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783694973] [2022-07-20 22:39:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783694973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:36,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:36,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58941536] [2022-07-20 22:39:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:36,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:36,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:36,384 INFO L87 Difference]: Start difference. First operand 194 states and 312 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:36,825 INFO L93 Difference]: Finished difference Result 406 states and 651 transitions. [2022-07-20 22:39:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:36,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 22:39:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:36,827 INFO L225 Difference]: With dead ends: 406 [2022-07-20 22:39:36,827 INFO L226 Difference]: Without dead ends: 222 [2022-07-20 22:39:36,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:36,828 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:36,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 22:39:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-20 22:39:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-07-20 22:39:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6225490196078431) internal successors, (331), 204 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 331 transitions. [2022-07-20 22:39:36,837 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 331 transitions. Word has length 44 [2022-07-20 22:39:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:36,837 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 331 transitions. [2022-07-20 22:39:36,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 331 transitions. [2022-07-20 22:39:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:39:36,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:36,851 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] [2022-07-20 22:39:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 22:39:36,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 868700126, now seen corresponding path program 1 times [2022-07-20 22:39:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:36,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086640695] [2022-07-20 22:39:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:36,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:36,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086640695] [2022-07-20 22:39:36,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086640695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:36,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:36,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790711756] [2022-07-20 22:39:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:36,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:36,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:36,974 INFO L87 Difference]: Start difference. First operand 205 states and 331 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:37,411 INFO L93 Difference]: Finished difference Result 406 states and 650 transitions. [2022-07-20 22:39:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:37,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-07-20 22:39:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:37,413 INFO L225 Difference]: With dead ends: 406 [2022-07-20 22:39:37,413 INFO L226 Difference]: Without dead ends: 222 [2022-07-20 22:39:37,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:37,415 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:37,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 471 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 22:39:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-20 22:39:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-07-20 22:39:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 204 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 330 transitions. [2022-07-20 22:39:37,423 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 330 transitions. Word has length 57 [2022-07-20 22:39:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:37,423 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 330 transitions. [2022-07-20 22:39:37,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 330 transitions. [2022-07-20 22:39:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 22:39:37,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:37,432 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] [2022-07-20 22:39:37,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 22:39:37,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 642771885, now seen corresponding path program 1 times [2022-07-20 22:39:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:37,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318884956] [2022-07-20 22:39:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:37,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318884956] [2022-07-20 22:39:37,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318884956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:37,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:37,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778130063] [2022-07-20 22:39:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:37,506 INFO L87 Difference]: Start difference. First operand 205 states and 330 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:38,010 INFO L93 Difference]: Finished difference Result 405 states and 648 transitions. [2022-07-20 22:39:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:38,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-20 22:39:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:38,012 INFO L225 Difference]: With dead ends: 405 [2022-07-20 22:39:38,013 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 22:39:38,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:38,014 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:38,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:39:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 22:39:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2022-07-20 22:39:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6127450980392157) internal successors, (329), 204 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 329 transitions. [2022-07-20 22:39:38,032 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 329 transitions. Word has length 58 [2022-07-20 22:39:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:38,033 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 329 transitions. [2022-07-20 22:39:38,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 329 transitions. [2022-07-20 22:39:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 22:39:38,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:38,041 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] [2022-07-20 22:39:38,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 22:39:38,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash -404738919, now seen corresponding path program 1 times [2022-07-20 22:39:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:38,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933773921] [2022-07-20 22:39:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933773921] [2022-07-20 22:39:38,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933773921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:38,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:38,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734733738] [2022-07-20 22:39:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:38,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:38,131 INFO L87 Difference]: Start difference. First operand 205 states and 329 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:38,846 INFO L93 Difference]: Finished difference Result 479 states and 760 transitions. [2022-07-20 22:39:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-20 22:39:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:38,848 INFO L225 Difference]: With dead ends: 479 [2022-07-20 22:39:38,848 INFO L226 Difference]: Without dead ends: 295 [2022-07-20 22:39:38,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:38,849 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 150 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:38,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 22:39:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-20 22:39:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 205. [2022-07-20 22:39:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5980392156862746) internal successors, (326), 204 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 326 transitions. [2022-07-20 22:39:38,854 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 326 transitions. Word has length 58 [2022-07-20 22:39:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:38,854 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 326 transitions. [2022-07-20 22:39:38,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 326 transitions. [2022-07-20 22:39:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 22:39:38,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:38,856 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] [2022-07-20 22:39:38,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 22:39:38,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1540605214, now seen corresponding path program 1 times [2022-07-20 22:39:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:38,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6710170] [2022-07-20 22:39:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6710170] [2022-07-20 22:39:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6710170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:38,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:38,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621592443] [2022-07-20 22:39:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:38,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:38,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:38,947 INFO L87 Difference]: Start difference. First operand 205 states and 326 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:39,421 INFO L93 Difference]: Finished difference Result 478 states and 754 transitions. [2022-07-20 22:39:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:39,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-20 22:39:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:39,423 INFO L225 Difference]: With dead ends: 478 [2022-07-20 22:39:39,423 INFO L226 Difference]: Without dead ends: 294 [2022-07-20 22:39:39,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:39,424 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:39,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:39:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-20 22:39:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-20 22:39:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5833333333333333) internal successors, (323), 204 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions. [2022-07-20 22:39:39,429 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 58 [2022-07-20 22:39:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:39,429 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions. [2022-07-20 22:39:39,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2022-07-20 22:39:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 22:39:39,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:39,430 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] [2022-07-20 22:39:39,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 22:39:39,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash -219751902, now seen corresponding path program 1 times [2022-07-20 22:39:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:39,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564266387] [2022-07-20 22:39:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:39,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:39,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564266387] [2022-07-20 22:39:39,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564266387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:39,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:39,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857860586] [2022-07-20 22:39:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:39,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:39,496 INFO L87 Difference]: Start difference. First operand 205 states and 323 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:40,196 INFO L93 Difference]: Finished difference Result 478 states and 749 transitions. [2022-07-20 22:39:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:40,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-20 22:39:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:40,198 INFO L225 Difference]: With dead ends: 478 [2022-07-20 22:39:40,198 INFO L226 Difference]: Without dead ends: 294 [2022-07-20 22:39:40,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:40,199 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:40,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 22:39:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-20 22:39:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-20 22:39:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5686274509803921) internal successors, (320), 204 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2022-07-20 22:39:40,205 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 58 [2022-07-20 22:39:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:40,205 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2022-07-20 22:39:40,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2022-07-20 22:39:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 22:39:40,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:40,206 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] [2022-07-20 22:39:40,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 22:39:40,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1716593643, now seen corresponding path program 1 times [2022-07-20 22:39:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:40,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956481010] [2022-07-20 22:39:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:40,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956481010] [2022-07-20 22:39:40,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956481010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:40,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:40,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276355326] [2022-07-20 22:39:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:40,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:40,288 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:40,855 INFO L93 Difference]: Finished difference Result 478 states and 744 transitions. [2022-07-20 22:39:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-20 22:39:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:40,856 INFO L225 Difference]: With dead ends: 478 [2022-07-20 22:39:40,857 INFO L226 Difference]: Without dead ends: 294 [2022-07-20 22:39:40,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:40,857 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 146 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:40,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 22:39:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-20 22:39:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-20 22:39:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.553921568627451) internal successors, (317), 204 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2022-07-20 22:39:40,861 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 317 transitions. Word has length 59 [2022-07-20 22:39:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:40,862 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 317 transitions. [2022-07-20 22:39:40,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions. [2022-07-20 22:39:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 22:39:40,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:40,862 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] [2022-07-20 22:39:40,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 22:39:40,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1056186316, now seen corresponding path program 1 times [2022-07-20 22:39:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:40,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486767156] [2022-07-20 22:39:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:40,934 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-20 22:39:40,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:40,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486767156] [2022-07-20 22:39:40,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486767156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:40,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:40,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191628458] [2022-07-20 22:39:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:40,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:40,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:40,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:40,936 INFO L87 Difference]: Start difference. First operand 205 states and 317 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:41,514 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2022-07-20 22:39:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:41,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-20 22:39:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:41,516 INFO L225 Difference]: With dead ends: 402 [2022-07-20 22:39:41,516 INFO L226 Difference]: Without dead ends: 218 [2022-07-20 22:39:41,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:41,517 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:41,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 22:39:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-20 22:39:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2022-07-20 22:39:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 204 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 316 transitions. [2022-07-20 22:39:41,522 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 316 transitions. Word has length 60 [2022-07-20 22:39:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:41,522 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 316 transitions. [2022-07-20 22:39:41,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 316 transitions. [2022-07-20 22:39:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 22:39:41,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:41,523 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] [2022-07-20 22:39:41,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 22:39:41,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash 614802448, now seen corresponding path program 1 times [2022-07-20 22:39:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630771137] [2022-07-20 22:39:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:41,591 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-20 22:39:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:41,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630771137] [2022-07-20 22:39:41,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630771137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:41,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:41,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531579005] [2022-07-20 22:39:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:41,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:41,593 INFO L87 Difference]: Start difference. First operand 205 states and 316 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:42,144 INFO L93 Difference]: Finished difference Result 478 states and 738 transitions. [2022-07-20 22:39:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-20 22:39:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:42,146 INFO L225 Difference]: With dead ends: 478 [2022-07-20 22:39:42,146 INFO L226 Difference]: Without dead ends: 294 [2022-07-20 22:39:42,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:42,146 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:42,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:39:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-20 22:39:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-20 22:39:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5343137254901962) internal successors, (313), 204 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 313 transitions. [2022-07-20 22:39:42,151 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 313 transitions. Word has length 61 [2022-07-20 22:39:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:42,151 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 313 transitions. [2022-07-20 22:39:42,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 313 transitions. [2022-07-20 22:39:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 22:39:42,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:42,151 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] [2022-07-20 22:39:42,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 22:39:42,152 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1287801256, now seen corresponding path program 1 times [2022-07-20 22:39:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:42,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482725894] [2022-07-20 22:39:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:42,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:42,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482725894] [2022-07-20 22:39:42,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482725894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:42,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:42,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:42,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430517155] [2022-07-20 22:39:42,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:42,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:42,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:42,233 INFO L87 Difference]: Start difference. First operand 205 states and 313 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:43,382 INFO L93 Difference]: Finished difference Result 508 states and 780 transitions. [2022-07-20 22:39:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:43,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-20 22:39:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:43,389 INFO L225 Difference]: With dead ends: 508 [2022-07-20 22:39:43,389 INFO L226 Difference]: Without dead ends: 324 [2022-07-20 22:39:43,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:43,390 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 119 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:43,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 22:39:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-20 22:39:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 245. [2022-07-20 22:39:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5532786885245902) internal successors, (379), 244 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-20 22:39:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2022-07-20 22:39:43,396 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 61 [2022-07-20 22:39:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:43,397 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2022-07-20 22:39:43,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2022-07-20 22:39:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 22:39:43,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:43,398 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] [2022-07-20 22:39:43,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 22:39:43,398 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1049026987, now seen corresponding path program 1 times [2022-07-20 22:39:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:43,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422959686] [2022-07-20 22:39:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422959686] [2022-07-20 22:39:43,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422959686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:43,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:43,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872293866] [2022-07-20 22:39:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:43,475 INFO L87 Difference]: Start difference. First operand 245 states and 379 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:43,995 INFO L93 Difference]: Finished difference Result 511 states and 793 transitions. [2022-07-20 22:39:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:43,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-20 22:39:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:43,997 INFO L225 Difference]: With dead ends: 511 [2022-07-20 22:39:43,997 INFO L226 Difference]: Without dead ends: 287 [2022-07-20 22:39:43,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:43,998 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 29 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:43,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 493 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:39:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-20 22:39:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 267. [2022-07-20 22:39:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5488721804511278) internal successors, (412), 266 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 412 transitions. [2022-07-20 22:39:44,002 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 412 transitions. Word has length 62 [2022-07-20 22:39:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:44,002 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 412 transitions. [2022-07-20 22:39:44,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 412 transitions. [2022-07-20 22:39:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-20 22:39:44,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:44,017 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 22:39:44,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 22:39:44,017 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1947485908, now seen corresponding path program 1 times [2022-07-20 22:39:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:44,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214925276] [2022-07-20 22:39:44,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:44,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214925276] [2022-07-20 22:39:44,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214925276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:44,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:44,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316621270] [2022-07-20 22:39:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:44,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:44,117 INFO L87 Difference]: Start difference. First operand 267 states and 412 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:44,838 INFO L93 Difference]: Finished difference Result 531 states and 823 transitions. [2022-07-20 22:39:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-07-20 22:39:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:44,840 INFO L225 Difference]: With dead ends: 531 [2022-07-20 22:39:44,840 INFO L226 Difference]: Without dead ends: 285 [2022-07-20 22:39:44,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:44,840 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 34 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:44,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 22:39:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-20 22:39:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 267. [2022-07-20 22:39:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5451127819548873) internal successors, (411), 266 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2022-07-20 22:39:44,846 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 75 [2022-07-20 22:39:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:44,847 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2022-07-20 22:39:44,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2022-07-20 22:39:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 22:39:44,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:44,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:44,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 22:39:44,848 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:44,848 INFO L85 PathProgramCache]: Analyzing trace with hash -655331449, now seen corresponding path program 1 times [2022-07-20 22:39:44,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:44,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584515282] [2022-07-20 22:39:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:44,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:44,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584515282] [2022-07-20 22:39:44,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584515282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:44,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:44,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108908890] [2022-07-20 22:39:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:44,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:44,942 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:45,369 INFO L93 Difference]: Finished difference Result 530 states and 820 transitions. [2022-07-20 22:39:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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 76 [2022-07-20 22:39:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:45,370 INFO L225 Difference]: With dead ends: 530 [2022-07-20 22:39:45,370 INFO L226 Difference]: Without dead ends: 284 [2022-07-20 22:39:45,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:45,371 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 38 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 499 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:45,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 499 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 22:39:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-20 22:39:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 267. [2022-07-20 22:39:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5413533834586466) internal successors, (410), 266 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2022-07-20 22:39:45,376 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 76 [2022-07-20 22:39:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:45,376 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2022-07-20 22:39:45,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2022-07-20 22:39:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-20 22:39:45,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:45,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:45,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 22:39:45,377 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:45,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 280248224, now seen corresponding path program 1 times [2022-07-20 22:39:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:45,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207829317] [2022-07-20 22:39:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:39:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:45,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207829317] [2022-07-20 22:39:45,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207829317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:45,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:45,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925179182] [2022-07-20 22:39:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:45,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:45,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:45,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:45,447 INFO L87 Difference]: Start difference. First operand 267 states and 410 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:46,193 INFO L93 Difference]: Finished difference Result 602 states and 927 transitions. [2022-07-20 22:39:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:46,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-07-20 22:39:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:46,195 INFO L225 Difference]: With dead ends: 602 [2022-07-20 22:39:46,195 INFO L226 Difference]: Without dead ends: 356 [2022-07-20 22:39:46,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:46,196 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 144 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:46,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 334 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 22:39:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-20 22:39:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 267. [2022-07-20 22:39:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5263157894736843) internal successors, (406), 266 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 406 transitions. [2022-07-20 22:39:46,201 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 406 transitions. Word has length 78 [2022-07-20 22:39:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:46,201 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 406 transitions. [2022-07-20 22:39:46,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 406 transitions. [2022-07-20 22:39:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-20 22:39:46,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:46,202 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] [2022-07-20 22:39:46,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 22:39:46,202 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1344832479, now seen corresponding path program 1 times [2022-07-20 22:39:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:46,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023561011] [2022-07-20 22:39:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:46,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:46,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023561011] [2022-07-20 22:39:46,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023561011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:46,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:46,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840364296] [2022-07-20 22:39:46,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:46,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:46,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:46,284 INFO L87 Difference]: Start difference. First operand 267 states and 406 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:46,877 INFO L93 Difference]: Finished difference Result 603 states and 918 transitions. [2022-07-20 22:39:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 84 [2022-07-20 22:39:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:46,878 INFO L225 Difference]: With dead ends: 603 [2022-07-20 22:39:46,879 INFO L226 Difference]: Without dead ends: 357 [2022-07-20 22:39:46,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:46,880 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 67 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:46,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 469 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 22:39:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-07-20 22:39:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 309. [2022-07-20 22:39:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5357142857142858) internal successors, (473), 308 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-07-20 22:39:46,885 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 84 [2022-07-20 22:39:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:46,885 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-07-20 22:39:46,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-07-20 22:39:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-20 22:39:46,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:46,886 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] [2022-07-20 22:39:46,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 22:39:46,886 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash -921185757, now seen corresponding path program 1 times [2022-07-20 22:39:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:46,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920778820] [2022-07-20 22:39:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:46,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920778820] [2022-07-20 22:39:46,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920778820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:46,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:46,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:46,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511565041] [2022-07-20 22:39:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:46,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:46,955 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:47,482 INFO L93 Difference]: Finished difference Result 646 states and 991 transitions. [2022-07-20 22:39:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:47,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 84 [2022-07-20 22:39:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:47,484 INFO L225 Difference]: With dead ends: 646 [2022-07-20 22:39:47,484 INFO L226 Difference]: Without dead ends: 358 [2022-07-20 22:39:47,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:47,485 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:47,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 591 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:39:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-20 22:39:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 333. [2022-07-20 22:39:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.533132530120482) internal successors, (509), 332 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 509 transitions. [2022-07-20 22:39:47,490 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 509 transitions. Word has length 84 [2022-07-20 22:39:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:47,491 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 509 transitions. [2022-07-20 22:39:47,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 509 transitions. [2022-07-20 22:39:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-20 22:39:47,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:47,493 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:47,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 22:39:47,493 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 742972446, now seen corresponding path program 1 times [2022-07-20 22:39:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:47,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519471706] [2022-07-20 22:39:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:47,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519471706] [2022-07-20 22:39:47,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519471706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:47,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:47,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028894544] [2022-07-20 22:39:47,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:47,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:47,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:47,603 INFO L87 Difference]: Start difference. First operand 333 states and 509 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-20 22:39:48,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:48,969 INFO L93 Difference]: Finished difference Result 771 states and 1187 transitions. [2022-07-20 22:39:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:48,969 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 97 [2022-07-20 22:39:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:48,971 INFO L225 Difference]: With dead ends: 771 [2022-07-20 22:39:48,971 INFO L226 Difference]: Without dead ends: 459 [2022-07-20 22:39:48,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:48,972 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:48,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 22:39:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-20 22:39:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 349. [2022-07-20 22:39:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.514367816091954) internal successors, (527), 348 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 527 transitions. [2022-07-20 22:39:48,977 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 527 transitions. Word has length 97 [2022-07-20 22:39:48,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:48,977 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 527 transitions. [2022-07-20 22:39:48,977 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-20 22:39:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 527 transitions. [2022-07-20 22:39:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 22:39:48,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:48,978 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:48,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 22:39:48,978 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash 659456893, now seen corresponding path program 1 times [2022-07-20 22:39:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:48,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408667829] [2022-07-20 22:39:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:49,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408667829] [2022-07-20 22:39:49,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408667829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:49,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:49,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173431416] [2022-07-20 22:39:49,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:49,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:49,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:49,113 INFO L87 Difference]: Start difference. First operand 349 states and 527 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:50,309 INFO L93 Difference]: Finished difference Result 755 states and 1147 transitions. [2022-07-20 22:39:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 98 [2022-07-20 22:39:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:50,310 INFO L225 Difference]: With dead ends: 755 [2022-07-20 22:39:50,310 INFO L226 Difference]: Without dead ends: 427 [2022-07-20 22:39:50,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:50,311 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 139 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:50,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 356 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 22:39:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-07-20 22:39:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2022-07-20 22:39:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4971264367816093) internal successors, (521), 348 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 521 transitions. [2022-07-20 22:39:50,317 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 521 transitions. Word has length 98 [2022-07-20 22:39:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:50,317 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 521 transitions. [2022-07-20 22:39:50,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 521 transitions. [2022-07-20 22:39:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-20 22:39:50,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:50,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:50,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 22:39:50,319 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash 280390343, now seen corresponding path program 1 times [2022-07-20 22:39:50,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:50,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097162038] [2022-07-20 22:39:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:50,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097162038] [2022-07-20 22:39:50,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097162038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:50,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:50,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:50,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023682902] [2022-07-20 22:39:50,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:50,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:50,418 INFO L87 Difference]: Start difference. First operand 349 states and 521 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:52,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:52,291 INFO L93 Difference]: Finished difference Result 712 states and 1064 transitions. [2022-07-20 22:39:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:52,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 104 [2022-07-20 22:39:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:52,292 INFO L225 Difference]: With dead ends: 712 [2022-07-20 22:39:52,292 INFO L226 Difference]: Without dead ends: 384 [2022-07-20 22:39:52,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:52,293 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 71 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:52,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 489 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 22:39:52,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-20 22:39:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 349. [2022-07-20 22:39:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4942528735632183) internal successors, (520), 348 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 520 transitions. [2022-07-20 22:39:52,299 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 520 transitions. Word has length 104 [2022-07-20 22:39:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:52,299 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 520 transitions. [2022-07-20 22:39:52,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 520 transitions. [2022-07-20 22:39:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-20 22:39:52,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:52,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:52,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 22:39:52,300 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:52,301 INFO L85 PathProgramCache]: Analyzing trace with hash 509759261, now seen corresponding path program 1 times [2022-07-20 22:39:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:52,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309592630] [2022-07-20 22:39:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309592630] [2022-07-20 22:39:52,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309592630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:52,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:52,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979457337] [2022-07-20 22:39:52,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:52,388 INFO L87 Difference]: Start difference. First operand 349 states and 520 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:52,935 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2022-07-20 22:39:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 22:39:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:52,936 INFO L225 Difference]: With dead ends: 710 [2022-07-20 22:39:52,937 INFO L226 Difference]: Without dead ends: 382 [2022-07-20 22:39:52,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:52,937 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 68 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:52,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 495 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:39:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-20 22:39:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 349. [2022-07-20 22:39:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4913793103448276) internal successors, (519), 348 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 519 transitions. [2022-07-20 22:39:52,944 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 519 transitions. Word has length 105 [2022-07-20 22:39:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:52,944 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 519 transitions. [2022-07-20 22:39:52,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 519 transitions. [2022-07-20 22:39:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-20 22:39:52,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:52,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:52,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 22:39:52,946 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -213108826, now seen corresponding path program 1 times [2022-07-20 22:39:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:52,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285453622] [2022-07-20 22:39:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285453622] [2022-07-20 22:39:53,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285453622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:53,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:53,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856230191] [2022-07-20 22:39:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:53,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:53,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:53,026 INFO L87 Difference]: Start difference. First operand 349 states and 519 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:53,683 INFO L93 Difference]: Finished difference Result 707 states and 1053 transitions. [2022-07-20 22:39:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:53,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 22:39:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:53,686 INFO L225 Difference]: With dead ends: 707 [2022-07-20 22:39:53,686 INFO L226 Difference]: Without dead ends: 379 [2022-07-20 22:39:53,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:53,686 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:53,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 501 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 22:39:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-20 22:39:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 349. [2022-07-20 22:39:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4885057471264367) internal successors, (518), 348 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 518 transitions. [2022-07-20 22:39:53,692 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 518 transitions. Word has length 105 [2022-07-20 22:39:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:53,692 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 518 transitions. [2022-07-20 22:39:53,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 518 transitions. [2022-07-20 22:39:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:39:53,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:53,705 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:53,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 22:39:53,706 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1295545029, now seen corresponding path program 1 times [2022-07-20 22:39:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:53,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311408063] [2022-07-20 22:39:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:39:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:53,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311408063] [2022-07-20 22:39:53,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311408063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:53,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:53,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224147887] [2022-07-20 22:39:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:53,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:53,778 INFO L87 Difference]: Start difference. First operand 349 states and 518 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:54,429 INFO L93 Difference]: Finished difference Result 755 states and 1129 transitions. [2022-07-20 22:39:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-20 22:39:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:54,431 INFO L225 Difference]: With dead ends: 755 [2022-07-20 22:39:54,431 INFO L226 Difference]: Without dead ends: 427 [2022-07-20 22:39:54,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:54,432 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 125 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:54,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 368 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 22:39:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-07-20 22:39:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2022-07-20 22:39:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4770114942528736) internal successors, (514), 348 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 514 transitions. [2022-07-20 22:39:54,437 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 514 transitions. Word has length 106 [2022-07-20 22:39:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:54,438 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 514 transitions. [2022-07-20 22:39:54,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 514 transitions. [2022-07-20 22:39:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:39:54,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:54,439 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:54,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 22:39:54,439 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 878148423, now seen corresponding path program 1 times [2022-07-20 22:39:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:54,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074639971] [2022-07-20 22:39:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 22:39:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:54,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074639971] [2022-07-20 22:39:54,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074639971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:54,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:54,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875337185] [2022-07-20 22:39:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:54,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:54,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,524 INFO L87 Difference]: Start difference. First operand 349 states and 514 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:54,552 INFO L93 Difference]: Finished difference Result 1000 states and 1488 transitions. [2022-07-20 22:39:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:54,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-20 22:39:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:54,554 INFO L225 Difference]: With dead ends: 1000 [2022-07-20 22:39:54,554 INFO L226 Difference]: Without dead ends: 672 [2022-07-20 22:39:54,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,558 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 136 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:54,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:39:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-20 22:39:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2022-07-20 22:39:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.473919523099851) internal successors, (989), 671 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 989 transitions. [2022-07-20 22:39:54,572 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 989 transitions. Word has length 106 [2022-07-20 22:39:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:54,573 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 989 transitions. [2022-07-20 22:39:54,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 989 transitions. [2022-07-20 22:39:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:39:54,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:54,574 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:54,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 22:39:54,575 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash -808031415, now seen corresponding path program 1 times [2022-07-20 22:39:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:54,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777864454] [2022-07-20 22:39:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 22:39:54,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:54,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777864454] [2022-07-20 22:39:54,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777864454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:54,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:54,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67328971] [2022-07-20 22:39:54,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:54,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:54,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:54,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,639 INFO L87 Difference]: Start difference. First operand 672 states and 989 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:54,660 INFO L93 Difference]: Finished difference Result 1350 states and 1990 transitions. [2022-07-20 22:39:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-20 22:39:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:54,662 INFO L225 Difference]: With dead ends: 1350 [2022-07-20 22:39:54,662 INFO L226 Difference]: Without dead ends: 699 [2022-07-20 22:39:54,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,663 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:54,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:39:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-20 22:39:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2022-07-20 22:39:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.4670487106017192) internal successors, (1024), 698 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1024 transitions. [2022-07-20 22:39:54,674 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1024 transitions. Word has length 106 [2022-07-20 22:39:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:54,674 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 1024 transitions. [2022-07-20 22:39:54,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1024 transitions. [2022-07-20 22:39:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:39:54,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:54,676 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:54,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 22:39:54,676 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1068451403, now seen corresponding path program 1 times [2022-07-20 22:39:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:54,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525819902] [2022-07-20 22:39:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-20 22:39:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:54,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525819902] [2022-07-20 22:39:54,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525819902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:54,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:54,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378534590] [2022-07-20 22:39:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:54,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:54,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:54,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,743 INFO L87 Difference]: Start difference. First operand 699 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:54,761 INFO L93 Difference]: Finished difference Result 1379 states and 2026 transitions. [2022-07-20 22:39:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:54,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-20 22:39:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:54,763 INFO L225 Difference]: With dead ends: 1379 [2022-07-20 22:39:54,763 INFO L226 Difference]: Without dead ends: 701 [2022-07-20 22:39:54,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,766 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:54,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:39:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-07-20 22:39:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2022-07-20 22:39:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.4657142857142857) internal successors, (1026), 700 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1026 transitions. [2022-07-20 22:39:54,776 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1026 transitions. Word has length 106 [2022-07-20 22:39:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:54,776 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1026 transitions. [2022-07-20 22:39:54,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1026 transitions. [2022-07-20 22:39:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 22:39:54,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:54,777 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:54,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 22:39:54,777 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash -414944271, now seen corresponding path program 1 times [2022-07-20 22:39:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:54,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020511488] [2022-07-20 22:39:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 22:39:54,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020511488] [2022-07-20 22:39:54,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020511488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:54,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:54,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225026557] [2022-07-20 22:39:54,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:54,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:54,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,854 INFO L87 Difference]: Start difference. First operand 701 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:54,890 INFO L93 Difference]: Finished difference Result 1707 states and 2514 transitions. [2022-07-20 22:39:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:54,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-20 22:39:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:54,893 INFO L225 Difference]: With dead ends: 1707 [2022-07-20 22:39:54,893 INFO L226 Difference]: Without dead ends: 1029 [2022-07-20 22:39:54,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,894 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:54,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:39:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2022-07-20 22:39:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1027. [2022-07-20 22:39:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4688109161793372) internal successors, (1507), 1026 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1507 transitions. [2022-07-20 22:39:54,917 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1507 transitions. Word has length 108 [2022-07-20 22:39:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:54,917 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1507 transitions. [2022-07-20 22:39:54,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1507 transitions. [2022-07-20 22:39:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-20 22:39:54,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:54,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:54,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 22:39:54,919 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2063160218, now seen corresponding path program 1 times [2022-07-20 22:39:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:54,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908606145] [2022-07-20 22:39:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 22:39:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908606145] [2022-07-20 22:39:54,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908606145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:54,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:54,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881082207] [2022-07-20 22:39:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:54,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:54,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:54,998 INFO L87 Difference]: Start difference. First operand 1027 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:55,040 INFO L93 Difference]: Finished difference Result 2353 states and 3470 transitions. [2022-07-20 22:39:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:55,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 125 [2022-07-20 22:39:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:55,044 INFO L225 Difference]: With dead ends: 2353 [2022-07-20 22:39:55,044 INFO L226 Difference]: Without dead ends: 1349 [2022-07-20 22:39:55,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:55,048 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:55,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:39:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-07-20 22:39:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2022-07-20 22:39:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4688427299703264) internal successors, (1980), 1348 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1980 transitions. [2022-07-20 22:39:55,069 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1980 transitions. Word has length 125 [2022-07-20 22:39:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:55,070 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1980 transitions. [2022-07-20 22:39:55,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1980 transitions. [2022-07-20 22:39:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 22:39:55,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:55,072 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:55,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 22:39:55,072 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash 726227607, now seen corresponding path program 1 times [2022-07-20 22:39:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:55,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573128433] [2022-07-20 22:39:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-20 22:39:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:55,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573128433] [2022-07-20 22:39:55,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573128433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:55,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:55,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72664066] [2022-07-20 22:39:55,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:55,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:55,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:55,185 INFO L87 Difference]: Start difference. First operand 1349 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:55,220 INFO L93 Difference]: Finished difference Result 2005 states and 2944 transitions. [2022-07-20 22:39:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-07-20 22:39:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:55,225 INFO L225 Difference]: With dead ends: 2005 [2022-07-20 22:39:55,225 INFO L226 Difference]: Without dead ends: 1677 [2022-07-20 22:39:55,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:55,227 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 157 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:55,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 373 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:39:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-07-20 22:39:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1675. [2022-07-20 22:39:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.467741935483871) internal successors, (2457), 1674 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2457 transitions. [2022-07-20 22:39:55,254 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2457 transitions. Word has length 128 [2022-07-20 22:39:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:55,255 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2457 transitions. [2022-07-20 22:39:55,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2457 transitions. [2022-07-20 22:39:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 22:39:55,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:55,257 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:55,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 22:39:55,257 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:55,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1329906676, now seen corresponding path program 1 times [2022-07-20 22:39:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:55,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288357657] [2022-07-20 22:39:55,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-20 22:39:55,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:55,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288357657] [2022-07-20 22:39:55,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288357657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:55,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:55,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:39:55,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497151034] [2022-07-20 22:39:55,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:55,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:39:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:55,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:39:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:55,620 INFO L87 Difference]: Start difference. First operand 1675 states and 2457 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:56,697 INFO L93 Difference]: Finished difference Result 3347 states and 4910 transitions. [2022-07-20 22:39:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:39:56,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 129 [2022-07-20 22:39:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:56,702 INFO L225 Difference]: With dead ends: 3347 [2022-07-20 22:39:56,702 INFO L226 Difference]: Without dead ends: 1675 [2022-07-20 22:39:56,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:39:56,704 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:56,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 22:39:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-07-20 22:39:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-07-20 22:39:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.4671445639187575) internal successors, (2456), 1674 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2456 transitions. [2022-07-20 22:39:56,732 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2456 transitions. Word has length 129 [2022-07-20 22:39:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:56,732 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2456 transitions. [2022-07-20 22:39:56,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:39:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2456 transitions. [2022-07-20 22:39:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 22:39:56,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:56,734 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:56,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 22:39:56,735 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:56,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2022-07-20 22:39:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:56,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145341246] [2022-07-20 22:39:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:39:57,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:39:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:39:57,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 22:39:57,545 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:39:57,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:39:57,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 22:39:57,551 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:39:57,553 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:39:57,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:39:57 BoogieIcfgContainer [2022-07-20 22:39:57,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:39:57,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:39:57,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:39:57,669 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:39:57,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:39:34" (3/4) ... [2022-07-20 22:39:57,672 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 22:39:57,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:39:57,672 INFO L158 Benchmark]: Toolchain (without parser) took 26134.39ms. Allocated memory was 54.5MB in the beginning and 209.7MB in the end (delta: 155.2MB). Free memory was 29.9MB in the beginning and 106.5MB in the end (delta: -76.6MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2022-07-20 22:39:57,673 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:39:57,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.57ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.8MB in the beginning and 44.9MB in the end (delta: -15.1MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2022-07-20 22:39:57,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.65ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 39.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 22:39:57,675 INFO L158 Benchmark]: Boogie Preprocessor took 63.07ms. Allocated memory is still 67.1MB. Free memory was 39.7MB in the beginning and 32.7MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 22:39:57,675 INFO L158 Benchmark]: RCFGBuilder took 1934.70ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.7MB in the beginning and 28.9MB in the end (delta: 3.9MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2022-07-20 22:39:57,679 INFO L158 Benchmark]: TraceAbstraction took 23593.36ms. Allocated memory was 81.8MB in the beginning and 209.7MB in the end (delta: 127.9MB). Free memory was 28.5MB in the beginning and 106.5MB in the end (delta: -77.9MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2022-07-20 22:39:57,679 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 209.7MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:39:57,681 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.11ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.57ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.8MB in the beginning and 44.9MB in the end (delta: -15.1MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.65ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 39.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.07ms. Allocated memory is still 67.1MB. Free memory was 39.7MB in the beginning and 32.7MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1934.70ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.7MB in the beginning and 28.9MB in the end (delta: 3.9MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23593.36ms. Allocated memory was 81.8MB in the beginning and 209.7MB in the end (delta: 127.9MB). Free memory was 28.5MB in the beginning and 106.5MB in the end (delta: -77.9MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 209.7MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1757]: 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 1475. 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)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [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={-4294967291:0}, s={-4294967291:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] EXPR s->cert VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=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:5}, blastFlag=1, got_new_session=0, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1388] s->init_num = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967310, (s->s3)->tmp.new_cipher={-4294967292:0}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->options=4294967315, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:5}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->verify_mode=7, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:5}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->session={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967310, (s->s3)->tmp.new_cipher={-4294967292:0}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=0, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1757] reach_error() VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=0, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2802 SdHoareTripleChecker+Valid, 18.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 13512 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7878 mSDsCounter, 836 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5592 IncrementalHoareTripleChecker+Invalid, 6428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 836 mSolverCounterUnsat, 5634 mSDtfsCounter, 5592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1675occurred in iteration=30, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 1354 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2660 NumberOfCodeBlocks, 2660 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2500 ConstructedInterpolants, 0 QuantifiedInterpolants, 6359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 1458/1458 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-20 22:39:57,718 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.11.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:39:59,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:39:59,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:39:59,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:39:59,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:39:59,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:39:59,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:39:59,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:39:59,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:39:59,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:39:59,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:39:59,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:39:59,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:39:59,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:39:59,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:39:59,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:39:59,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:39:59,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:39:59,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:39:59,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:39:59,403 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:39:59,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:39:59,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:39:59,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:39:59,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:39:59,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:39:59,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:39:59,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:39:59,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:39:59,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:39:59,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:39:59,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:39:59,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:39:59,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:39:59,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:39:59,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:39:59,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:39:59,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:39:59,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:39:59,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:39:59,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:39:59,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:39:59,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 22:39:59,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:39:59,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:39:59,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:39:59,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:39:59,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:39:59,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:39:59,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:39:59,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:39:59,459 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:39:59,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:39:59,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:39:59,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:39:59,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:39:59,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:39:59,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:39:59,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:39:59,461 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 22:39:59,461 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 22:39:59,461 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 22:39:59,461 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:39:59,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:39:59,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:39:59,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:39:59,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:39:59,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:39:59,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:39:59,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:39:59,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:39:59,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:39:59,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:39:59,463 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 22:39:59,463 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 22:39:59,463 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:39:59,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:39:59,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:39:59,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 22:39:59,464 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2022-07-20 22:39:59,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:39:59,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:39:59,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:39:59,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:39:59,739 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:39:59,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-20 22:39:59,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39644a84/bb54e49082d44473b9f6c292e88c6352/FLAGc40b8cd3c [2022-07-20 22:40:00,272 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:40:00,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-20 22:40:00,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39644a84/bb54e49082d44473b9f6c292e88c6352/FLAGc40b8cd3c [2022-07-20 22:40:00,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39644a84/bb54e49082d44473b9f6c292e88c6352 [2022-07-20 22:40:00,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:40:00,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:40:00,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:40:00,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:40:00,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:40:00,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:00,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b5f69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00, skipping insertion in model container [2022-07-20 22:40:00,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:00,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:40:00,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:40:00,644 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.11.i.cil-1.c[74369,74382] [2022-07-20 22:40:00,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:40:00,661 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 22:40:00,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:40:00,759 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.11.i.cil-1.c[74369,74382] [2022-07-20 22:40:00,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:40:00,774 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:40:00,850 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.11.i.cil-1.c[74369,74382] [2022-07-20 22:40:00,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:40:00,878 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:40:00,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00 WrapperNode [2022-07-20 22:40:00,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:40:00,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:40:00,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:40:00,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:40:00,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:00,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:00,943 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762 [2022-07-20 22:40:00,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:40:00,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:40:00,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:40:00,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:40:00,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:00,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:00,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:00,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:01,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:01,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:01,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:01,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:40:01,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:40:01,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:40:01,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:40:01,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (1/1) ... [2022-07-20 22:40:01,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:40:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:40:01,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 22:40:01,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 22:40:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:40:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 22:40:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:40:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 22:40:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:40:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:40:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:40:01,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:40:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 22:40:01,267 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:40:01,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:40:01,309 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:40:07,875 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-20 22:40:07,875 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-20 22:40:07,875 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:40:07,880 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:40:07,880 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:40:07,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:40:07 BoogieIcfgContainer [2022-07-20 22:40:07,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:40:07,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:40:07,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:40:07,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:40:07,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:40:00" (1/3) ... [2022-07-20 22:40:07,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e08da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:40:07, skipping insertion in model container [2022-07-20 22:40:07,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:40:00" (2/3) ... [2022-07-20 22:40:07,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e08da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:40:07, skipping insertion in model container [2022-07-20 22:40:07,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:40:07" (3/3) ... [2022-07-20 22:40:07,887 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-07-20 22:40:07,896 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:40:07,897 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:40:07,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:40:07,934 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@1c56efa7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b60b75b [2022-07-20 22:40:07,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:40:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:40:07,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:07,949 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] [2022-07-20 22:40:07,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2022-07-20 22:40:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:07,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450171928] [2022-07-20 22:40:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:07,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:07,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:07,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 22:40:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:08,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:40:08,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:40:08,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:40:08,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:40:08,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450171928] [2022-07-20 22:40:08,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450171928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:08,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:08,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:40:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13982289] [2022-07-20 22:40:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:08,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:40:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:40:08,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:40:08,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:08,650 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:08,787 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions. [2022-07-20 22:40:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:40:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-20 22:40:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:08,805 INFO L225 Difference]: With dead ends: 427 [2022-07-20 22:40:08,806 INFO L226 Difference]: Without dead ends: 261 [2022-07-20 22:40:08,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:08,815 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:08,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 461 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:40:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-20 22:40:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-07-20 22:40:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5153846153846153) internal successors, (394), 260 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2022-07-20 22:40:08,881 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37 [2022-07-20 22:40:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:08,882 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2022-07-20 22:40:08,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2022-07-20 22:40:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 22:40:08,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:08,888 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] [2022-07-20 22:40:08,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 22:40:09,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:09,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1297584632, now seen corresponding path program 1 times [2022-07-20 22:40:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:09,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459596550] [2022-07-20 22:40:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:09,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:09,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:09,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 22:40:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:09,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:40:09,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:40:09,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:40:09,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:40:09,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459596550] [2022-07-20 22:40:09,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459596550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:09,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:09,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:40:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760137993] [2022-07-20 22:40:09,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:09,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:40:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:40:09,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:40:09,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:09,639 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:09,958 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions. [2022-07-20 22:40:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:40:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-07-20 22:40:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:09,960 INFO L225 Difference]: With dead ends: 510 [2022-07-20 22:40:09,960 INFO L226 Difference]: Without dead ends: 383 [2022-07-20 22:40:09,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:09,962 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:09,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 22:40:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-20 22:40:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-07-20 22:40:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 382 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions. [2022-07-20 22:40:09,977 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54 [2022-07-20 22:40:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:09,977 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions. [2022-07-20 22:40:09,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions. [2022-07-20 22:40:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 22:40:09,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:09,980 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] [2022-07-20 22:40:09,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-20 22:40:10,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:10,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2072838766, now seen corresponding path program 1 times [2022-07-20 22:40:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:10,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309314800] [2022-07-20 22:40:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:10,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:10,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:10,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:10,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 22:40:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:10,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:40:10,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 22:40:10,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:40:10,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:40:10,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309314800] [2022-07-20 22:40:10,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309314800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:10,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:10,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:40:10,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204206934] [2022-07-20 22:40:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:10,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:40:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:40:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:40:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:10,738 INFO L87 Difference]: Start difference. First operand 383 states and 575 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-20 22:40:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:11,164 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions. [2022-07-20 22:40:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:40:11,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 76 [2022-07-20 22:40:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:11,166 INFO L225 Difference]: With dead ends: 754 [2022-07-20 22:40:11,166 INFO L226 Difference]: Without dead ends: 505 [2022-07-20 22:40:11,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:11,168 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:11,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 22:40:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-20 22:40:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2022-07-20 22:40:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.501984126984127) internal successors, (757), 504 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions. [2022-07-20 22:40:11,177 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76 [2022-07-20 22:40:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:11,178 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions. [2022-07-20 22:40:11,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-20 22:40:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions. [2022-07-20 22:40:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 22:40:11,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:11,180 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:40:11,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 22:40:11,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:11,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1458485308, now seen corresponding path program 1 times [2022-07-20 22:40:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:11,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929261194] [2022-07-20 22:40:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:11,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:11,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:11,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 22:40:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:11,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:40:11,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 22:40:12,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:40:12,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:40:12,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929261194] [2022-07-20 22:40:12,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929261194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:12,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:12,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:40:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666719519] [2022-07-20 22:40:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:12,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:40:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:40:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:40:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:12,017 INFO L87 Difference]: Start difference. First operand 505 states and 757 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:13,056 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions. [2022-07-20 22:40:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:40:13,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 100 [2022-07-20 22:40:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:13,061 INFO L225 Difference]: With dead ends: 1000 [2022-07-20 22:40:13,061 INFO L226 Difference]: Without dead ends: 629 [2022-07-20 22:40:13,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:13,062 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:13,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 572 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 22:40:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-07-20 22:40:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2022-07-20 22:40:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4984076433121019) internal successors, (941), 628 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions. [2022-07-20 22:40:13,078 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100 [2022-07-20 22:40:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:13,078 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions. [2022-07-20 22:40:13,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions. [2022-07-20 22:40:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 22:40:13,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:13,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:40:13,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 22:40:13,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:13,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:13,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1045011737, now seen corresponding path program 1 times [2022-07-20 22:40:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:13,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323279556] [2022-07-20 22:40:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:13,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:13,285 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:13,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 22:40:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:13,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:40:13,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 22:40:13,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:40:13,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:40:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323279556] [2022-07-20 22:40:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323279556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:13,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:13,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:40:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798493118] [2022-07-20 22:40:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:13,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:40:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:40:13,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:40:13,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:13,902 INFO L87 Difference]: Start difference. First operand 629 states and 941 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:14,396 INFO L93 Difference]: Finished difference Result 1246 states and 1875 transitions. [2022-07-20 22:40:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:40:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 117 [2022-07-20 22:40:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:14,399 INFO L225 Difference]: With dead ends: 1246 [2022-07-20 22:40:14,399 INFO L226 Difference]: Without dead ends: 751 [2022-07-20 22:40:14,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:40:14,400 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:14,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:40:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-07-20 22:40:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2022-07-20 22:40:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.496) internal successors, (1122), 750 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1122 transitions. [2022-07-20 22:40:14,412 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1122 transitions. Word has length 117 [2022-07-20 22:40:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:14,412 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1122 transitions. [2022-07-20 22:40:14,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1122 transitions. [2022-07-20 22:40:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 22:40:14,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:14,414 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:40:14,431 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-20 22:40:14,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:14,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485834, now seen corresponding path program 1 times [2022-07-20 22:40:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353530943] [2022-07-20 22:40:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:14,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:14,633 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:14,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 22:40:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:15,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 22:40:15,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:15,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 22:40:15,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 22:40:16,380 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-20 22:40:16,380 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 78 treesize of output 85 [2022-07-20 22:40:16,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,472 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 78 treesize of output 85 [2022-07-20 22:40:16,608 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-20 22:40:16,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-20 22:40:16,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:16,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-20 22:40:16,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 22:40:16,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 22:40:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-20 22:40:16,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:40:16,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:40:16,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353530943] [2022-07-20 22:40:16,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353530943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:16,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:16,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:40:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79938720] [2022-07-20 22:40:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:16,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:40:16,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:40:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:40:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:40:16,700 INFO L87 Difference]: Start difference. First operand 751 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:18,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:20,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:21,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:29,802 INFO L93 Difference]: Finished difference Result 1499 states and 2240 transitions. [2022-07-20 22:40:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:40:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 129 [2022-07-20 22:40:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:29,806 INFO L225 Difference]: With dead ends: 1499 [2022-07-20 22:40:29,806 INFO L226 Difference]: Without dead ends: 751 [2022-07-20 22:40:29,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:40:29,809 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:29,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2022-07-20 22:40:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-07-20 22:40:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2022-07-20 22:40:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4946666666666666) internal successors, (1121), 750 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1121 transitions. [2022-07-20 22:40:29,822 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1121 transitions. Word has length 129 [2022-07-20 22:40:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:29,823 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1121 transitions. [2022-07-20 22:40:29,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1121 transitions. [2022-07-20 22:40:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 22:40:29,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:29,825 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:40:29,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 22:40:30,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:30,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1440991432, now seen corresponding path program 1 times [2022-07-20 22:40:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:30,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736971194] [2022-07-20 22:40:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:30,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:30,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:30,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:30,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 22:40:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:31,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 22:40:31,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:31,262 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-20 22:40:31,263 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 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-20 22:40:31,383 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-20 22:40:31,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-20 22:40:31,444 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:40:31,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-20 22:40:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 22:40:31,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:40:31,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:40:31,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736971194] [2022-07-20 22:40:31,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736971194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:31,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:31,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:40:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057474696] [2022-07-20 22:40:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:31,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:40:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:40:31,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:40:31,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:40:31,462 INFO L87 Difference]: Start difference. First operand 751 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:33,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:38,981 INFO L93 Difference]: Finished difference Result 1770 states and 2646 transitions. [2022-07-20 22:40:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:40:38,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 129 [2022-07-20 22:40:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:38,990 INFO L225 Difference]: With dead ends: 1770 [2022-07-20 22:40:38,990 INFO L226 Difference]: Without dead ends: 1029 [2022-07-20 22:40:38,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:40:38,992 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:38,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 590 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 1 Unknown, 40 Unchecked, 7.5s Time] [2022-07-20 22:40:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2022-07-20 22:40:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 906. [2022-07-20 22:40:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.529281767955801) internal successors, (1384), 905 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1384 transitions. [2022-07-20 22:40:39,011 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1384 transitions. Word has length 129 [2022-07-20 22:40:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:39,012 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1384 transitions. [2022-07-20 22:40:39,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:40:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1384 transitions. [2022-07-20 22:40:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 22:40:39,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:39,014 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:40:39,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 22:40:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:39,238 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2022-07-20 22:40:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:40:39,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415499695] [2022-07-20 22:40:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:40:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:40:39,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:40:39,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 22:40:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:40:43,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:40:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:40:46,160 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 22:40:46,160 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:40:46,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:40:46,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 22:40:46,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:40:46,370 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:40:46,372 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:40:46,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:40:46 BoogieIcfgContainer [2022-07-20 22:40:46,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:40:46,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:40:46,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:40:46,481 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:40:46,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:40:07" (3/4) ... [2022-07-20 22:40:46,482 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 22:40:46,583 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 22:40:46,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:40:46,584 INFO L158 Benchmark]: Toolchain (without parser) took 46272.17ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 36.9MB in the beginning and 41.4MB in the end (delta: -4.5MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2022-07-20 22:40:46,584 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 60.8MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:40:46,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.93ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 36.6MB in the beginning and 53.7MB in the end (delta: -17.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2022-07-20 22:40:46,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.11ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 48.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:40:46,585 INFO L158 Benchmark]: Boogie Preprocessor took 79.27ms. Allocated memory is still 75.5MB. Free memory was 48.8MB in the beginning and 41.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 22:40:46,585 INFO L158 Benchmark]: RCFGBuilder took 6853.74ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 41.8MB in the beginning and 62.3MB in the end (delta: -20.5MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-07-20 22:40:46,585 INFO L158 Benchmark]: TraceAbstraction took 38596.90ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 23.5MB in the end (delta: 38.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-07-20 22:40:46,586 INFO L158 Benchmark]: Witness Printer took 103.14ms. Allocated memory is still 98.6MB. Free memory was 22.9MB in the beginning and 41.4MB in the end (delta: -18.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:40:46,589 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.12ms. Allocated memory is still 60.8MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.93ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 36.6MB in the beginning and 53.7MB in the end (delta: -17.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.11ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 48.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.27ms. Allocated memory is still 75.5MB. Free memory was 48.8MB in the beginning and 41.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 6853.74ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 41.8MB in the beginning and 62.3MB in the end (delta: -20.5MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38596.90ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 23.5MB in the end (delta: 38.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 103.14ms. Allocated memory is still 98.6MB. Free memory was 22.9MB in the beginning and 41.4MB in the end (delta: -18.5MB). Peak memory consumption was 4.2MB. 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: 1757]: 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)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7:0}, s->cert={6: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] 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={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7: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={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] 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={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7: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={7:0}, s={7: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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, 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={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={1073741837:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->options=2097152, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:-2147483648}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->verify_mode=1, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:-2147483648}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->session={12:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={1073741837:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=8, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1757] reach_error() VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=8, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.5s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 22.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 3999 SdHoareTripleChecker+Invalid, 22.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 2210 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=906occurred in iteration=7, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 123 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 635 ConstructedInterpolants, 1 QuantifiedInterpolants, 1250 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5501 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 534/534 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-20 22:40:46,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE