./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:37:19,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:37:19,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:37:19,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:37:19,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:37:19,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:37:19,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:37:19,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:37:19,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:37:19,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:37:19,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:37:19,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:37:19,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:37:19,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:37:19,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:37:19,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:37:19,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:37:19,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:37:19,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:37:19,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:37:19,131 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:37:19,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:37:19,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:37:19,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:37:19,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:37:19,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:37:19,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:37:19,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:37:19,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:37:19,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:37:19,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:37:19,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:37:19,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:37:19,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:37:19,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:37:19,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:37:19,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:37:19,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:37:19,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:37:19,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:37:19,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:37:19,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:37:19,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:37:19,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:37:19,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:37:19,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:37:19,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:37:19,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:37:19,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:37:19,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:37:19,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:37:19,173 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:37:19,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:37:19,174 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:37:19,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:37:19,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:37:19,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:37:19,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:37:19,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:37:19,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:37:19,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:37:19,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:37:19,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:37:19,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:37:19,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:37:19,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:37:19,177 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:37:19,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:37:19,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:37:19,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 [2022-07-13 11:37:19,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:37:19,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:37:19,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:37:19,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:37:19,380 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:37:19,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-13 11:37:19,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4128dd0ec/ca5048fcaa4244a5a6e878b1e1703076/FLAG0256a8607 [2022-07-13 11:37:19,893 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:37:19,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-13 11:37:19,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4128dd0ec/ca5048fcaa4244a5a6e878b1e1703076/FLAG0256a8607 [2022-07-13 11:37:19,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4128dd0ec/ca5048fcaa4244a5a6e878b1e1703076 [2022-07-13 11:37:19,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:37:19,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:37:19,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:37:19,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:37:19,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:37:19,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:37:19" (1/1) ... [2022-07-13 11:37:19,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c950a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:19, skipping insertion in model container [2022-07-13 11:37:19,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:37:19" (1/1) ... [2022-07-13 11:37:19,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:37:20,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:37:20,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72493,72506] [2022-07-13 11:37:20,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:37:20,467 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:37:20,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72493,72506] [2022-07-13 11:37:20,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:37:20,576 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:37:20,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20 WrapperNode [2022-07-13 11:37:20,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:37:20,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:37:20,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:37:20,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:37:20,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,637 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 782 [2022-07-13 11:37:20,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:37:20,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:37:20,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:37:20,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:37:20,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:37:20,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:37:20,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:37:20,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:37:20,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (1/1) ... [2022-07-13 11:37:20,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:37:20,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:37:20,744 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-13 11:37:20,796 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-13 11:37:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:37:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:37:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:37:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:37:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:37:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:37:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:37:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:37:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:37:20,988 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:37:20,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:37:21,017 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:37:23,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:37:23,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:37:23,521 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:37:23,528 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:37:23,528 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:37:23,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:37:23 BoogieIcfgContainer [2022-07-13 11:37:23,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:37:23,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:37:23,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:37:23,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:37:23,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:37:19" (1/3) ... [2022-07-13 11:37:23,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288ff594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:37:23, skipping insertion in model container [2022-07-13 11:37:23,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:20" (2/3) ... [2022-07-13 11:37:23,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288ff594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:37:23, skipping insertion in model container [2022-07-13 11:37:23,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:37:23" (3/3) ... [2022-07-13 11:37:23,538 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-07-13 11:37:23,550 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:37:23,550 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:37:23,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:37:23,596 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@674f9281, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d5e4c8a [2022-07-13 11:37:23,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:37:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:37:23,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:23,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:23,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2022-07-13 11:37:23,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:23,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365100616] [2022-07-13 11:37:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:24,079 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-13 11:37:24,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:24,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365100616] [2022-07-13 11:37:24,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365100616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:24,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:24,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124088997] [2022-07-13 11:37:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:24,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:24,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:24,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:24,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:24,124 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:25,151 INFO L93 Difference]: Finished difference Result 406 states and 687 transitions. [2022-07-13 11:37:25,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:25,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-13 11:37:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:25,160 INFO L225 Difference]: With dead ends: 406 [2022-07-13 11:37:25,161 INFO L226 Difference]: Without dead ends: 246 [2022-07-13 11:37:25,163 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-13 11:37:25,165 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 142 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:25,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 411 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 11:37:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-13 11:37:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 175. [2022-07-13 11:37:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.6091954022988506) internal successors, (280), 174 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2022-07-13 11:37:25,220 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 47 [2022-07-13 11:37:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:25,221 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2022-07-13 11:37:25,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2022-07-13 11:37:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:37:25,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:25,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:37:25,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1376830255, now seen corresponding path program 1 times [2022-07-13 11:37:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:25,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834232196] [2022-07-13 11:37:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:25,345 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-13 11:37:25,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:25,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834232196] [2022-07-13 11:37:25,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834232196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:25,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:25,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:25,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335827658] [2022-07-13 11:37:25,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:25,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:25,348 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:26,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:26,909 INFO L93 Difference]: Finished difference Result 368 states and 587 transitions. [2022-07-13 11:37:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-13 11:37:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:26,910 INFO L225 Difference]: With dead ends: 368 [2022-07-13 11:37:26,910 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 11:37:26,911 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-13 11:37:26,912 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:26,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 439 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 11:37:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 11:37:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-13 11:37:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6162162162162161) internal successors, (299), 185 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 299 transitions. [2022-07-13 11:37:26,922 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 299 transitions. Word has length 48 [2022-07-13 11:37:26,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:26,923 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 299 transitions. [2022-07-13 11:37:26,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 299 transitions. [2022-07-13 11:37:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:37:26,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:26,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:26,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:37:26,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2069426656, now seen corresponding path program 1 times [2022-07-13 11:37:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:26,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546678889] [2022-07-13 11:37:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:27,098 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-13 11:37:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:27,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546678889] [2022-07-13 11:37:27,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546678889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:27,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:27,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142614582] [2022-07-13 11:37:27,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:27,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:27,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:27,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:27,101 INFO L87 Difference]: Start difference. First operand 186 states and 299 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:29,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:29,360 INFO L93 Difference]: Finished difference Result 368 states and 586 transitions. [2022-07-13 11:37:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:29,360 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-13 11:37:29,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:29,361 INFO L225 Difference]: With dead ends: 368 [2022-07-13 11:37:29,362 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 11:37:29,362 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-13 11:37:29,363 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 24 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:29,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 441 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 11:37:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-13 11:37:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6108108108108108) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-07-13 11:37:29,378 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 298 transitions. Word has length 61 [2022-07-13 11:37:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:29,378 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-13 11:37:29,378 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-13 11:37:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-07-13 11:37:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:37:29,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:29,380 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:29,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:37:29,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2105609775, now seen corresponding path program 1 times [2022-07-13 11:37:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:29,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355353236] [2022-07-13 11:37:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:29,520 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-13 11:37:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:29,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355353236] [2022-07-13 11:37:29,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355353236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:29,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:29,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504740943] [2022-07-13 11:37:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:29,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:29,522 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:31,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:31,768 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-07-13 11:37:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:31,769 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-13 11:37:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:31,770 INFO L225 Difference]: With dead ends: 367 [2022-07-13 11:37:31,770 INFO L226 Difference]: Without dead ends: 202 [2022-07-13 11:37:31,770 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-13 11:37:31,771 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 28 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:31,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-13 11:37:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-13 11:37:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6054054054054054) internal successors, (297), 185 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 297 transitions. [2022-07-13 11:37:31,779 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 297 transitions. Word has length 62 [2022-07-13 11:37:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:31,779 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 297 transitions. [2022-07-13 11:37:31,780 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-13 11:37:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 297 transitions. [2022-07-13 11:37:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:37:31,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:31,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:31,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:37:31,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1980827365, now seen corresponding path program 1 times [2022-07-13 11:37:31,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:31,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299864749] [2022-07-13 11:37:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:31,856 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-13 11:37:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:31,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299864749] [2022-07-13 11:37:31,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299864749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:31,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:31,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:31,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541536357] [2022-07-13 11:37:31,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:31,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:31,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:31,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:31,859 INFO L87 Difference]: Start difference. First operand 186 states and 297 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:33,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:34,097 INFO L93 Difference]: Finished difference Result 367 states and 583 transitions. [2022-07-13 11:37:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:34,098 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-13 11:37:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:34,098 INFO L225 Difference]: With dead ends: 367 [2022-07-13 11:37:34,099 INFO L226 Difference]: Without dead ends: 202 [2022-07-13 11:37:34,099 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-13 11:37:34,101 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 26 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:34,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-13 11:37:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-13 11:37:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 296 transitions. [2022-07-13 11:37:34,109 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 296 transitions. Word has length 62 [2022-07-13 11:37:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:34,109 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 296 transitions. [2022-07-13 11:37:34,109 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-13 11:37:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 296 transitions. [2022-07-13 11:37:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:37:34,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:34,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:34,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:37:34,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash 159955684, now seen corresponding path program 1 times [2022-07-13 11:37:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:34,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449044273] [2022-07-13 11:37:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:34,194 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-13 11:37:34,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:34,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449044273] [2022-07-13 11:37:34,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449044273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:34,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:34,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966785853] [2022-07-13 11:37:34,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:34,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:34,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:34,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:34,196 INFO L87 Difference]: Start difference. First operand 186 states and 296 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:36,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:36,417 INFO L93 Difference]: Finished difference Result 366 states and 581 transitions. [2022-07-13 11:37:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:36,417 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-13 11:37:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:36,418 INFO L225 Difference]: With dead ends: 366 [2022-07-13 11:37:36,418 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 11:37:36,419 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-13 11:37:36,419 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 19 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:36,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 445 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 11:37:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2022-07-13 11:37:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5945945945945945) internal successors, (295), 185 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 295 transitions. [2022-07-13 11:37:36,436 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 295 transitions. Word has length 62 [2022-07-13 11:37:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:36,436 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 295 transitions. [2022-07-13 11:37:36,436 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-13 11:37:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 295 transitions. [2022-07-13 11:37:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:37:36,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:36,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:36,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:37:36,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 794933796, now seen corresponding path program 1 times [2022-07-13 11:37:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:36,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087038850] [2022-07-13 11:37:36,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:36,506 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-13 11:37:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087038850] [2022-07-13 11:37:36,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087038850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:36,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:36,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653384310] [2022-07-13 11:37:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:36,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:36,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:36,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:36,508 INFO L87 Difference]: Start difference. First operand 186 states and 295 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:38,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:38,679 INFO L93 Difference]: Finished difference Result 364 states and 578 transitions. [2022-07-13 11:37:38,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:38,680 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-13 11:37:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:38,681 INFO L225 Difference]: With dead ends: 364 [2022-07-13 11:37:38,681 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 11:37:38,681 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-13 11:37:38,682 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:38,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 11:37:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-13 11:37:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5891891891891892) internal successors, (294), 185 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 294 transitions. [2022-07-13 11:37:38,690 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 294 transitions. Word has length 62 [2022-07-13 11:37:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:38,690 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 294 transitions. [2022-07-13 11:37:38,690 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-13 11:37:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 294 transitions. [2022-07-13 11:37:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 11:37:38,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:38,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:38,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:37:38,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1302432407, now seen corresponding path program 1 times [2022-07-13 11:37:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:38,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378737559] [2022-07-13 11:37:38,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:38,770 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-13 11:37:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378737559] [2022-07-13 11:37:38,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378737559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:38,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:38,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841265121] [2022-07-13 11:37:38,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:38,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:38,773 INFO L87 Difference]: Start difference. First operand 186 states and 294 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:40,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:40,968 INFO L93 Difference]: Finished difference Result 364 states and 577 transitions. [2022-07-13 11:37:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-13 11:37:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:40,971 INFO L225 Difference]: With dead ends: 364 [2022-07-13 11:37:40,971 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 11:37:40,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-13 11:37:40,972 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 22 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:40,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 11:37:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-13 11:37:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5837837837837838) internal successors, (293), 185 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2022-07-13 11:37:40,976 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 63 [2022-07-13 11:37:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:40,980 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2022-07-13 11:37:40,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2022-07-13 11:37:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 11:37:40,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:40,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:40,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:37:40,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1198430410, now seen corresponding path program 1 times [2022-07-13 11:37:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:40,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039704083] [2022-07-13 11:37:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:41,063 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-13 11:37:41,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:41,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039704083] [2022-07-13 11:37:41,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039704083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:41,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:41,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131202457] [2022-07-13 11:37:41,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:41,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:41,066 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:43,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:43,243 INFO L93 Difference]: Finished difference Result 364 states and 576 transitions. [2022-07-13 11:37:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:43,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-13 11:37:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:43,244 INFO L225 Difference]: With dead ends: 364 [2022-07-13 11:37:43,244 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 11:37:43,245 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-13 11:37:43,245 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 20 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:43,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 449 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 11:37:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-13 11:37:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 185 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 292 transitions. [2022-07-13 11:37:43,249 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 292 transitions. Word has length 64 [2022-07-13 11:37:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:43,249 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 292 transitions. [2022-07-13 11:37:43,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 292 transitions. [2022-07-13 11:37:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:37:43,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:43,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:43,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:37:43,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1676500242, now seen corresponding path program 1 times [2022-07-13 11:37:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:43,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855232412] [2022-07-13 11:37:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:43,329 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-13 11:37:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855232412] [2022-07-13 11:37:43,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855232412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:43,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:43,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652697733] [2022-07-13 11:37:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:43,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:43,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:43,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:43,332 INFO L87 Difference]: Start difference. First operand 186 states and 292 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:45,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:45,499 INFO L93 Difference]: Finished difference Result 354 states and 562 transitions. [2022-07-13 11:37:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:45,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-13 11:37:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:45,501 INFO L225 Difference]: With dead ends: 354 [2022-07-13 11:37:45,501 INFO L226 Difference]: Without dead ends: 189 [2022-07-13 11:37:45,501 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-13 11:37:45,501 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:45,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 463 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-13 11:37:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-07-13 11:37:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.572972972972973) internal successors, (291), 185 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2022-07-13 11:37:45,520 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 65 [2022-07-13 11:37:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:45,520 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2022-07-13 11:37:45,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2022-07-13 11:37:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:37:45,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:45,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:45,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:37:45,521 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:45,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1196291754, now seen corresponding path program 1 times [2022-07-13 11:37:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:45,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026300324] [2022-07-13 11:37:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:45,613 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-13 11:37:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:45,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026300324] [2022-07-13 11:37:45,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026300324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:45,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:45,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839459958] [2022-07-13 11:37:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:45,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:45,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:45,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:45,615 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:47,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:48,087 INFO L93 Difference]: Finished difference Result 465 states and 733 transitions. [2022-07-13 11:37:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-13 11:37:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:48,091 INFO L225 Difference]: With dead ends: 465 [2022-07-13 11:37:48,091 INFO L226 Difference]: Without dead ends: 298 [2022-07-13 11:37:48,092 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-13 11:37:48,092 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 111 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:48,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 312 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 11:37:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-13 11:37:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 228. [2022-07-13 11:37:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6255506607929515) internal successors, (369), 227 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2022-07-13 11:37:48,099 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 65 [2022-07-13 11:37:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:48,099 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2022-07-13 11:37:48,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2022-07-13 11:37:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 11:37:48,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:48,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:48,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:37:48,100 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash -103652171, now seen corresponding path program 1 times [2022-07-13 11:37:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:48,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819055232] [2022-07-13 11:37:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:37:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:48,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819055232] [2022-07-13 11:37:48,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819055232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:48,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:48,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:48,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519046773] [2022-07-13 11:37:48,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:48,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:48,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:48,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:48,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:48,192 INFO L87 Difference]: Start difference. First operand 228 states and 369 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:50,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:50,487 INFO L93 Difference]: Finished difference Result 544 states and 881 transitions. [2022-07-13 11:37:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-13 11:37:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:50,489 INFO L225 Difference]: With dead ends: 544 [2022-07-13 11:37:50,489 INFO L226 Difference]: Without dead ends: 337 [2022-07-13 11:37:50,489 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-13 11:37:50,490 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 119 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:50,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-13 11:37:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 260. [2022-07-13 11:37:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.6447876447876448) internal successors, (426), 259 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 426 transitions. [2022-07-13 11:37:50,494 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 426 transitions. Word has length 93 [2022-07-13 11:37:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:50,496 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 426 transitions. [2022-07-13 11:37:50,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 426 transitions. [2022-07-13 11:37:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 11:37:50,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:50,497 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:50,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:37:50,497 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash -430845807, now seen corresponding path program 1 times [2022-07-13 11:37:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:50,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731000012] [2022-07-13 11:37:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:37:50,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:50,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731000012] [2022-07-13 11:37:50,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731000012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:50,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:50,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:50,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979838960] [2022-07-13 11:37:50,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:50,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:50,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:50,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:50,596 INFO L87 Difference]: Start difference. First operand 260 states and 426 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:52,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:52,895 INFO L93 Difference]: Finished difference Result 613 states and 1000 transitions. [2022-07-13 11:37:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-13 11:37:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:52,897 INFO L225 Difference]: With dead ends: 613 [2022-07-13 11:37:52,897 INFO L226 Difference]: Without dead ends: 374 [2022-07-13 11:37:52,897 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-13 11:37:52,898 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:52,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 318 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 263 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-13 11:37:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 303. [2022-07-13 11:37:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.6622516556291391) internal successors, (502), 302 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 502 transitions. [2022-07-13 11:37:52,903 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 502 transitions. Word has length 105 [2022-07-13 11:37:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:52,908 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 502 transitions. [2022-07-13 11:37:52,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 502 transitions. [2022-07-13 11:37:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:37:52,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:52,909 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:52,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:37:52,909 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:52,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 827966928, now seen corresponding path program 1 times [2022-07-13 11:37:52,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:52,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165135395] [2022-07-13 11:37:52,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:53,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165135395] [2022-07-13 11:37:53,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165135395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:53,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:53,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015740100] [2022-07-13 11:37:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:53,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:53,008 INFO L87 Difference]: Start difference. First operand 303 states and 502 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:55,318 INFO L93 Difference]: Finished difference Result 697 states and 1149 transitions. [2022-07-13 11:37:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:55,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-13 11:37:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:55,320 INFO L225 Difference]: With dead ends: 697 [2022-07-13 11:37:55,320 INFO L226 Difference]: Without dead ends: 415 [2022-07-13 11:37:55,321 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-13 11:37:55,321 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 136 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:55,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 302 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-13 11:37:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 319. [2022-07-13 11:37:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.650943396226415) internal successors, (525), 318 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 525 transitions. [2022-07-13 11:37:55,327 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 525 transitions. Word has length 106 [2022-07-13 11:37:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:55,328 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 525 transitions. [2022-07-13 11:37:55,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 525 transitions. [2022-07-13 11:37:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:37:55,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:55,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:55,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:37:55,330 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -421532676, now seen corresponding path program 1 times [2022-07-13 11:37:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:55,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070654649] [2022-07-13 11:37:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 11:37:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:55,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070654649] [2022-07-13 11:37:55,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070654649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:55,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:55,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762528378] [2022-07-13 11:37:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:55,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:55,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:55,415 INFO L87 Difference]: Start difference. First operand 319 states and 525 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:57,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:57,649 INFO L93 Difference]: Finished difference Result 660 states and 1090 transitions. [2022-07-13 11:37:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:57,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-13 11:37:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:57,651 INFO L225 Difference]: With dead ends: 660 [2022-07-13 11:37:57,651 INFO L226 Difference]: Without dead ends: 362 [2022-07-13 11:37:57,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:37:57,653 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 33 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:57,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 461 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-13 11:37:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-07-13 11:37:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6529411764705881) internal successors, (562), 340 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 562 transitions. [2022-07-13 11:37:57,660 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 562 transitions. Word has length 106 [2022-07-13 11:37:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:57,661 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 562 transitions. [2022-07-13 11:37:57,661 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-13 11:37:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 562 transitions. [2022-07-13 11:37:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 11:37:57,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:57,662 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:57,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:37:57,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1425787158, now seen corresponding path program 1 times [2022-07-13 11:37:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:57,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798583025] [2022-07-13 11:37:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:57,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798583025] [2022-07-13 11:37:57,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798583025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:57,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:57,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336987262] [2022-07-13 11:37:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:57,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:57,735 INFO L87 Difference]: Start difference. First operand 341 states and 562 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:59,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:00,018 INFO L93 Difference]: Finished difference Result 731 states and 1193 transitions. [2022-07-13 11:38:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-13 11:38:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:00,020 INFO L225 Difference]: With dead ends: 731 [2022-07-13 11:38:00,020 INFO L226 Difference]: Without dead ends: 411 [2022-07-13 11:38:00,021 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-13 11:38:00,021 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 135 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:00,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:38:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-07-13 11:38:00,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 341. [2022-07-13 11:38:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.638235294117647) internal successors, (557), 340 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 557 transitions. [2022-07-13 11:38:00,027 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 557 transitions. Word has length 107 [2022-07-13 11:38:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:00,027 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 557 transitions. [2022-07-13 11:38:00,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 557 transitions. [2022-07-13 11:38:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 11:38:00,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:00,028 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:00,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:38:00,028 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash -778017264, now seen corresponding path program 1 times [2022-07-13 11:38:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:00,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036790921] [2022-07-13 11:38:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 11:38:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:00,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036790921] [2022-07-13 11:38:00,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036790921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:00,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:00,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:00,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331570872] [2022-07-13 11:38:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:00,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:00,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:00,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:00,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:00,127 INFO L87 Difference]: Start difference. First operand 341 states and 557 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:02,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:02,411 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2022-07-13 11:38:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-13 11:38:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:02,412 INFO L225 Difference]: With dead ends: 730 [2022-07-13 11:38:02,413 INFO L226 Difference]: Without dead ends: 410 [2022-07-13 11:38:02,413 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-13 11:38:02,413 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 140 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:02,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:38:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-13 11:38:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-13 11:38:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6205882352941177) internal successors, (551), 340 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 551 transitions. [2022-07-13 11:38:02,419 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 551 transitions. Word has length 120 [2022-07-13 11:38:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:02,420 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 551 transitions. [2022-07-13 11:38:02,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 551 transitions. [2022-07-13 11:38:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 11:38:02,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:02,421 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:02,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:38:02,421 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 934196388, now seen corresponding path program 1 times [2022-07-13 11:38:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:02,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236250852] [2022-07-13 11:38:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 11:38:02,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:02,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236250852] [2022-07-13 11:38:02,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236250852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:02,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:02,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748823216] [2022-07-13 11:38:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:02,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:02,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:02,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:02,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:02,498 INFO L87 Difference]: Start difference. First operand 341 states and 551 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:04,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:04,826 INFO L93 Difference]: Finished difference Result 730 states and 1170 transitions. [2022-07-13 11:38:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:04,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-13 11:38:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:04,829 INFO L225 Difference]: With dead ends: 730 [2022-07-13 11:38:04,829 INFO L226 Difference]: Without dead ends: 410 [2022-07-13 11:38:04,829 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-13 11:38:04,830 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 138 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:04,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 304 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:38:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-13 11:38:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-13 11:38:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6029411764705883) internal successors, (545), 340 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 545 transitions. [2022-07-13 11:38:04,837 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 545 transitions. Word has length 120 [2022-07-13 11:38:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:04,837 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 545 transitions. [2022-07-13 11:38:04,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 545 transitions. [2022-07-13 11:38:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 11:38:04,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:04,838 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:04,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:38:04,839 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 691990311, now seen corresponding path program 1 times [2022-07-13 11:38:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:04,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994513711] [2022-07-13 11:38:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 11:38:04,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:04,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994513711] [2022-07-13 11:38:04,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994513711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:04,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:04,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805849966] [2022-07-13 11:38:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:04,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:04,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:04,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:04,909 INFO L87 Difference]: Start difference. First operand 341 states and 545 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:06,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:07,012 INFO L93 Difference]: Finished difference Result 678 states and 1088 transitions. [2022-07-13 11:38:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-13 11:38:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:07,023 INFO L225 Difference]: With dead ends: 678 [2022-07-13 11:38:07,023 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 11:38:07,024 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-13 11:38:07,026 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:07,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:38:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 11:38:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-13 11:38:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6) internal successors, (544), 340 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 544 transitions. [2022-07-13 11:38:07,050 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 544 transitions. Word has length 120 [2022-07-13 11:38:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:07,050 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 544 transitions. [2022-07-13 11:38:07,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 544 transitions. [2022-07-13 11:38:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:38:07,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:07,051 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:38:07,051 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1061009666, now seen corresponding path program 1 times [2022-07-13 11:38:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:07,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205477527] [2022-07-13 11:38:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 11:38:07,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:07,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205477527] [2022-07-13 11:38:07,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205477527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:07,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:07,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196222513] [2022-07-13 11:38:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:07,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:07,244 INFO L87 Difference]: Start difference. First operand 341 states and 544 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:09,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:09,504 INFO L93 Difference]: Finished difference Result 678 states and 1086 transitions. [2022-07-13 11:38:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:09,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-13 11:38:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:09,506 INFO L225 Difference]: With dead ends: 678 [2022-07-13 11:38:09,506 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 11:38:09,507 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-13 11:38:09,508 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 37 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:09,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:38:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 11:38:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-13 11:38:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5970588235294119) internal successors, (543), 340 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 543 transitions. [2022-07-13 11:38:09,515 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 543 transitions. Word has length 121 [2022-07-13 11:38:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:09,515 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 543 transitions. [2022-07-13 11:38:09,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 543 transitions. [2022-07-13 11:38:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 11:38:09,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:09,517 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:09,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:38:09,517 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 955624361, now seen corresponding path program 1 times [2022-07-13 11:38:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:09,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708973487] [2022-07-13 11:38:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:09,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 11:38:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:09,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708973487] [2022-07-13 11:38:09,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708973487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:09,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:09,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083013991] [2022-07-13 11:38:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:09,614 INFO L87 Difference]: Start difference. First operand 341 states and 543 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:11,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:11,885 INFO L93 Difference]: Finished difference Result 730 states and 1154 transitions. [2022-07-13 11:38:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-13 11:38:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:11,887 INFO L225 Difference]: With dead ends: 730 [2022-07-13 11:38:11,887 INFO L226 Difference]: Without dead ends: 410 [2022-07-13 11:38:11,888 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-13 11:38:11,888 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 135 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:11,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:38:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-13 11:38:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-13 11:38:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5794117647058823) internal successors, (537), 340 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 537 transitions. [2022-07-13 11:38:11,904 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 537 transitions. Word has length 122 [2022-07-13 11:38:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:11,905 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 537 transitions. [2022-07-13 11:38:11,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 537 transitions. [2022-07-13 11:38:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 11:38:11,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:11,906 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:11,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:38:11,906 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1509717981, now seen corresponding path program 1 times [2022-07-13 11:38:11,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:11,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068160918] [2022-07-13 11:38:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:11,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 11:38:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:11,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068160918] [2022-07-13 11:38:11,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068160918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:11,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:11,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831878523] [2022-07-13 11:38:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:11,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:11,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:11,993 INFO L87 Difference]: Start difference. First operand 341 states and 537 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:13,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:14,166 INFO L93 Difference]: Finished difference Result 668 states and 1059 transitions. [2022-07-13 11:38:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:14,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-13 11:38:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:14,167 INFO L225 Difference]: With dead ends: 668 [2022-07-13 11:38:14,167 INFO L226 Difference]: Without dead ends: 348 [2022-07-13 11:38:14,168 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-13 11:38:14,168 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 26 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:14,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 483 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:38:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-13 11:38:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2022-07-13 11:38:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.576470588235294) internal successors, (536), 340 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 536 transitions. [2022-07-13 11:38:14,173 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 536 transitions. Word has length 123 [2022-07-13 11:38:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:14,173 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 536 transitions. [2022-07-13 11:38:14,173 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-13 11:38:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 536 transitions. [2022-07-13 11:38:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:38:14,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:14,174 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:14,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:38:14,174 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2022-07-13 11:38:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:14,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593578712] [2022-07-13 11:38:14,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-13 11:38:14,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:14,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593578712] [2022-07-13 11:38:14,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593578712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:14,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:14,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:38:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138761106] [2022-07-13 11:38:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:14,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:38:14,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:14,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:38:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:14,439 INFO L87 Difference]: Start difference. First operand 341 states and 536 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:16,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:18,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:18,309 INFO L93 Difference]: Finished difference Result 679 states and 1068 transitions. [2022-07-13 11:38:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:38:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:38:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:18,311 INFO L225 Difference]: With dead ends: 679 [2022-07-13 11:38:18,311 INFO L226 Difference]: Without dead ends: 341 [2022-07-13 11:38:18,311 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-13 11:38:18,312 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:18,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-07-13 11:38:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-13 11:38:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-13 11:38:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5735294117647058) internal successors, (535), 340 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 535 transitions. [2022-07-13 11:38:18,334 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 535 transitions. Word has length 127 [2022-07-13 11:38:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:18,334 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 535 transitions. [2022-07-13 11:38:18,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 535 transitions. [2022-07-13 11:38:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:38:18,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:18,336 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:38:18,336 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2022-07-13 11:38:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:18,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962154998] [2022-07-13 11:38:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:38:18,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:38:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:38:18,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:38:18,958 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:38:18,958 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:38:18,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:38:18,961 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:18,964 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:38:19,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:38:19 BoogieIcfgContainer [2022-07-13 11:38:19,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:38:19,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:38:19,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:38:19,046 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:38:19,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:37:23" (3/4) ... [2022-07-13 11:38:19,049 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:38:19,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:38:19,049 INFO L158 Benchmark]: Toolchain (without parser) took 59110.33ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 83.5MB in the beginning and 83.3MB in the end (delta: 192.2kB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2022-07-13 11:38:19,049 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:38:19,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.55ms. Allocated memory is still 115.3MB. Free memory was 83.2MB in the beginning and 67.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2022-07-13 11:38:19,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.68ms. Allocated memory is still 115.3MB. Free memory was 67.5MB in the beginning and 62.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:38:19,050 INFO L158 Benchmark]: Boogie Preprocessor took 42.12ms. Allocated memory is still 115.3MB. Free memory was 62.5MB in the beginning and 55.8MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:38:19,050 INFO L158 Benchmark]: RCFGBuilder took 2850.00ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 55.4MB in the beginning and 80.1MB in the end (delta: -24.7MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-07-13 11:38:19,050 INFO L158 Benchmark]: TraceAbstraction took 55514.30ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 79.2MB in the beginning and 83.3MB in the end (delta: -4.1MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2022-07-13 11:38:19,050 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 167.8MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:38:19,051 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.18ms. Allocated memory is still 90.2MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.55ms. Allocated memory is still 115.3MB. Free memory was 83.2MB in the beginning and 67.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.68ms. Allocated memory is still 115.3MB. Free memory was 67.5MB in the beginning and 62.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.12ms. Allocated memory is still 115.3MB. Free memory was 62.5MB in the beginning and 55.8MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2850.00ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 55.4MB in the beginning and 80.1MB in the end (delta: -24.7MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55514.30ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 79.2MB in the beginning and 83.3MB in the end (delta: -4.1MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 167.8MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1734]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->info_callback={0:-12}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-12}, blastFlag=1, got_new_session=0, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1388] s->init_num = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1606] COND FALSE !(! tmp___10) VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1734] reach_error() VAL [={0:-12}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.4s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 51.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1494 mSDsluCounter, 9447 SdHoareTripleChecker+Invalid, 49.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5867 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4419 IncrementalHoareTripleChecker+Invalid, 5054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 3580 mSDtfsCounter, 4419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 847 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2008 ConstructedInterpolants, 0 QuantifiedInterpolants, 4903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1128/1128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 11:38:19,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:38:20,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:38:20,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:38:20,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:38:20,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:38:20,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:38:20,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:38:20,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:38:20,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:38:20,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:38:20,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:38:20,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:38:20,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:38:20,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:38:20,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:38:20,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:38:20,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:38:20,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:38:20,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:38:20,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:38:20,882 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:38:20,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:38:20,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:38:20,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:38:20,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:38:20,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:38:20,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:38:20,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:38:20,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:38:20,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:38:20,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:38:20,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:38:20,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:38:20,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:38:20,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:38:20,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:38:20,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:38:20,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:38:20,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:38:20,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:38:20,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:38:20,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:38:20,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:38:20,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:38:20,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:38:20,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:38:20,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:38:20,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:38:20,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:38:20,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:38:20,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:38:20,923 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:38:20,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:38:20,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:38:20,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:38:20,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:38:20,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:38:20,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:38:20,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:38:20,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:38:20,925 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:38:20,925 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:38:20,925 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:38:20,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:38:20,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:38:20,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:38:20,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:38:20,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:38:20,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:38:20,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:38:20,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:38:20,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:38:20,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:38:20,927 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:38:20,927 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:38:20,927 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:38:20,927 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:38:20,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:38:20,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:38:20,928 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 [2022-07-13 11:38:21,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:38:21,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:38:21,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:38:21,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:38:21,262 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:38:21,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-13 11:38:21,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d9ce0cc/3a34f3d8e7a94805b9a8d036ac75f947/FLAGf6c7f6267 [2022-07-13 11:38:21,688 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:38:21,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-13 11:38:21,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d9ce0cc/3a34f3d8e7a94805b9a8d036ac75f947/FLAGf6c7f6267 [2022-07-13 11:38:22,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d9ce0cc/3a34f3d8e7a94805b9a8d036ac75f947 [2022-07-13 11:38:22,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:38:22,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:38:22,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:38:22,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:38:22,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:38:22,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49345f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22, skipping insertion in model container [2022-07-13 11:38:22,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:38:22,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:38:22,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72493,72506] [2022-07-13 11:38:22,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:22,533 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 11:38:22,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:38:22,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72493,72506] [2022-07-13 11:38:22,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:22,627 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:38:22,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72493,72506] [2022-07-13 11:38:22,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:22,714 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:38:22,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22 WrapperNode [2022-07-13 11:38:22,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:38:22,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:38:22,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:38:22,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:38:22,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,797 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 752 [2022-07-13 11:38:22,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:38:22,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:38:22,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:38:22,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:38:22,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:38:22,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:38:22,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:38:22,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:38:22,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (1/1) ... [2022-07-13 11:38:22,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:38:22,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:38:22,905 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-13 11:38:22,924 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-13 11:38:22,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:38:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:38:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:38:22,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:38:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:38:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:38:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:38:22,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:38:22,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:38:23,044 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:38:23,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:38:23,057 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:38:30,340 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:38:30,340 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:38:30,340 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:38:30,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:38:30,351 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:38:30,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:30 BoogieIcfgContainer [2022-07-13 11:38:30,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:38:30,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:38:30,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:38:30,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:38:30,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:38:22" (1/3) ... [2022-07-13 11:38:30,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75837ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:38:30, skipping insertion in model container [2022-07-13 11:38:30,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:22" (2/3) ... [2022-07-13 11:38:30,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75837ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:38:30, skipping insertion in model container [2022-07-13 11:38:30,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:30" (3/3) ... [2022-07-13 11:38:30,361 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-07-13 11:38:30,370 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:38:30,370 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:38:30,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:38:30,413 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@695a1f8e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d863cd9 [2022-07-13 11:38:30,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:38:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:38:30,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:30,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:30,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2022-07-13 11:38:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171632293] [2022-07-13 11:38:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:30,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:30,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:30,465 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-13 11:38:30,476 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-13 11:38:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:30,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:38:30,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:31,070 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-13 11:38:31,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:31,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:31,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171632293] [2022-07-13 11:38:31,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171632293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:31,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:31,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:38:31,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844328043] [2022-07-13 11:38:31,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:31,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:38:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:38:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:31,106 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:31,193 INFO L93 Difference]: Finished difference Result 412 states and 698 transitions. [2022-07-13 11:38:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:38:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-13 11:38:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:31,205 INFO L225 Difference]: With dead ends: 412 [2022-07-13 11:38:31,205 INFO L226 Difference]: Without dead ends: 251 [2022-07-13 11:38:31,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:31,211 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 186 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:31,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 456 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:38:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-13 11:38:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-07-13 11:38:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.516) internal successors, (379), 250 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2022-07-13 11:38:31,245 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 47 [2022-07-13 11:38:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:31,245 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2022-07-13 11:38:31,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2022-07-13 11:38:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 11:38:31,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:31,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:31,262 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-13 11:38:31,462 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-13 11:38:31,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1008654101, now seen corresponding path program 1 times [2022-07-13 11:38:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:31,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501845507] [2022-07-13 11:38:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:31,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:31,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:31,465 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-13 11:38:31,498 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-13 11:38:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:31,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:38:31,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:31,958 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-13 11:38:31,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:31,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:31,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501845507] [2022-07-13 11:38:31,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501845507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:31,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:31,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:38:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037380499] [2022-07-13 11:38:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:31,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:38:31,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:38:31,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:31,961 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:32,030 INFO L93 Difference]: Finished difference Result 490 states and 746 transitions. [2022-07-13 11:38:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:38:32,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-13 11:38:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:32,033 INFO L225 Difference]: With dead ends: 490 [2022-07-13 11:38:32,033 INFO L226 Difference]: Without dead ends: 368 [2022-07-13 11:38:32,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:32,034 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:32,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 557 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:38:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-13 11:38:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-07-13 11:38:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.5122615803814714) internal successors, (555), 367 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2022-07-13 11:38:32,055 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 64 [2022-07-13 11:38:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:32,057 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2022-07-13 11:38:32,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2022-07-13 11:38:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 11:38:32,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:32,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:32,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:38:32,275 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-13 11:38:32,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1548644719, now seen corresponding path program 1 times [2022-07-13 11:38:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:32,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464479506] [2022-07-13 11:38:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:32,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:32,279 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-13 11:38:32,281 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-13 11:38:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:32,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:38:32,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:32,841 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-13 11:38:32,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:32,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464479506] [2022-07-13 11:38:32,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464479506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:32,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:32,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:38:32,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385689024] [2022-07-13 11:38:32,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:32,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:38:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:32,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:38:32,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:32,843 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:32,951 INFO L93 Difference]: Finished difference Result 725 states and 1100 transitions. [2022-07-13 11:38:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:38:32,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-13 11:38:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:32,953 INFO L225 Difference]: With dead ends: 725 [2022-07-13 11:38:32,953 INFO L226 Difference]: Without dead ends: 486 [2022-07-13 11:38:32,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:32,955 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:32,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 561 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:38:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-13 11:38:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-07-13 11:38:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.511340206185567) internal successors, (733), 485 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 733 transitions. [2022-07-13 11:38:32,966 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 733 transitions. Word has length 86 [2022-07-13 11:38:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:32,966 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 733 transitions. [2022-07-13 11:38:32,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 733 transitions. [2022-07-13 11:38:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:38:32,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:32,970 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:32,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 11:38:33,190 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-13 11:38:33,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:33,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2022-07-13 11:38:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:33,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257939814] [2022-07-13 11:38:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:33,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:33,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:33,207 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-13 11:38:33,208 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-13 11:38:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:34,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 11:38:34,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:34,137 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-13 11:38:34,148 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-13 11:38:34,683 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-13 11:38:34,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 58 treesize of output 85 [2022-07-13 11:38:34,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2022-07-13 11:38:34,896 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:38:34,897 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-13 11:38:34,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:34,927 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-13 11:38:34,947 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-13 11:38:34,950 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-13 11:38:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-13 11:38:34,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:34,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:34,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257939814] [2022-07-13 11:38:34,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257939814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:34,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:34,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:38:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14034835] [2022-07-13 11:38:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:34,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:38:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:34,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:38:34,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:34,970 INFO L87 Difference]: Start difference. First operand 486 states and 733 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:36,992 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-13 11:38:38,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:41,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:45,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:47,753 INFO L93 Difference]: Finished difference Result 969 states and 1462 transitions. [2022-07-13 11:38:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:38:47,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:38:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:47,759 INFO L225 Difference]: With dead ends: 969 [2022-07-13 11:38:47,759 INFO L226 Difference]: Without dead ends: 486 [2022-07-13 11:38:47,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:38:47,760 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:47,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2022-07-13 11:38:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-13 11:38:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-07-13 11:38:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.5092783505154639) internal successors, (732), 485 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 732 transitions. [2022-07-13 11:38:47,778 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 732 transitions. Word has length 127 [2022-07-13 11:38:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:47,779 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 732 transitions. [2022-07-13 11:38:47,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 732 transitions. [2022-07-13 11:38:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:38:47,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:47,782 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:47,807 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-13 11:38:47,984 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-13 11:38:47,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2022-07-13 11:38:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:47,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856920369] [2022-07-13 11:38:47,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:47,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:47,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:47,987 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-13 11:38:47,988 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-13 11:38:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:38:50,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:38:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:38:53,404 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 11:38:53,405 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:38:53,405 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:38:53,434 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-13 11:38:53,628 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-13 11:38:53,630 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-13 11:38:53,633 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:38:53,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:38:53 BoogieIcfgContainer [2022-07-13 11:38:53,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:38:53,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:38:53,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:38:53,799 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:38:53,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:30" (3/4) ... [2022-07-13 11:38:53,801 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 11:38:53,941 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:38:53,941 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:38:53,942 INFO L158 Benchmark]: Toolchain (without parser) took 31885.95ms. Allocated memory was 65.0MB in the beginning and 111.1MB in the end (delta: 46.1MB). Free memory was 37.8MB in the beginning and 68.8MB in the end (delta: -31.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2022-07-13 11:38:53,942 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:38:53,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.36ms. Allocated memory is still 65.0MB. Free memory was 37.6MB in the beginning and 30.8MB in the end (delta: 6.7MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-07-13 11:38:53,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.17ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.8MB in the beginning and 58.2MB in the end (delta: -27.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:38:53,943 INFO L158 Benchmark]: Boogie Preprocessor took 83.06ms. Allocated memory is still 79.7MB. Free memory was 58.2MB in the beginning and 51.1MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:38:53,943 INFO L158 Benchmark]: RCFGBuilder took 7471.30ms. Allocated memory was 79.7MB in the beginning and 111.1MB in the end (delta: 31.5MB). Free memory was 51.1MB in the beginning and 79.2MB in the end (delta: -28.2MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-07-13 11:38:53,943 INFO L158 Benchmark]: TraceAbstraction took 23442.38ms. Allocated memory is still 111.1MB. Free memory was 78.5MB in the beginning and 39.0MB in the end (delta: 39.6MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2022-07-13 11:38:53,943 INFO L158 Benchmark]: Witness Printer took 143.03ms. Allocated memory is still 111.1MB. Free memory was 39.0MB in the beginning and 68.8MB in the end (delta: -29.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:38:53,946 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.15ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.36ms. Allocated memory is still 65.0MB. Free memory was 37.6MB in the beginning and 30.8MB in the end (delta: 6.7MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.17ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.8MB in the beginning and 58.2MB in the end (delta: -27.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.06ms. Allocated memory is still 79.7MB. Free memory was 58.2MB in the beginning and 51.1MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7471.30ms. Allocated memory was 79.7MB in the beginning and 111.1MB in the end (delta: 31.5MB). Free memory was 51.1MB in the beginning and 79.2MB in the end (delta: -28.2MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23442.38ms. Allocated memory is still 111.1MB. Free memory was 78.5MB in the beginning and 39.0MB in the end (delta: 39.6MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * Witness Printer took 143.03ms. Allocated memory is still 111.1MB. Free memory was 39.0MB in the beginning and 68.8MB in the end (delta: -29.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1734]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->cert={-2147483636:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1388] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1260] COND TRUE s->state == 8656 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1606] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1266] COND TRUE s->state == 8672 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=6, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1734] reach_error() VAL [={0:-2147483648}, blastFlag=3, got_new_session=1, init=1, ret=6, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 2205 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1033 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1172 mSDtfsCounter, 211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=486occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 668 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2830 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 153/153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 11:38:54,003 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