./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_clnt.blast.04.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:13:12,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:13:12,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:13:12,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:13:12,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:13:12,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:13:12,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:13:12,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:13:12,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:13:12,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:13:12,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:13:12,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:13:12,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:13:12,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:13:12,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:13:12,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:13:12,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:13:12,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:13:12,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:13:12,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:13:12,100 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:13:12,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:13:12,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:13:12,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:13:12,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:13:12,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:13:12,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:13:12,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:13:12,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:13:12,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:13:12,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:13:12,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:13:12,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:13:12,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:13:12,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:13:12,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:13:12,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:13:12,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:13:12,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:13:12,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:13:12,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:13:12,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:13:12,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:13:12,139 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:13:12,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:13:12,140 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:13:12,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:13:12,141 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:13:12,141 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:13:12,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:13:12,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:13:12,142 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:13:12,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:13:12,143 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:13:12,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:13:12,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:13:12,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:13:12,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:13:12,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:13:12,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:13:12,144 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:13:12,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:13:12,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:13:12,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:13:12,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:13:12,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:13:12,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:13:12,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:13:12,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:13:12,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:13:12,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:13:12,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:13:12,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:13:12,147 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:13:12,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:13:12,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:13:12,147 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 -> 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 [2022-07-22 11:13:12,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:13:12,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:13:12,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:13:12,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:13:12,331 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:13:12,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-22 11:13:12,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f004280/334a0b9e9e52417b8c34166a819ac291/FLAG59c8097ab [2022-07-22 11:13:12,777 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:13:12,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-22 11:13:12,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f004280/334a0b9e9e52417b8c34166a819ac291/FLAG59c8097ab [2022-07-22 11:13:13,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f004280/334a0b9e9e52417b8c34166a819ac291 [2022-07-22 11:13:13,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:13:13,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:13:13,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:13:13,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:13:13,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:13:13,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0105d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13, skipping insertion in model container [2022-07-22 11:13:13,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:13:13,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:13:13,453 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_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-22 11:13:13,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:13:13,468 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:13:13,523 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_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-22 11:13:13,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:13:13,541 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:13:13,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13 WrapperNode [2022-07-22 11:13:13,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:13:13,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:13:13,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:13:13,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:13:13,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,599 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-07-22 11:13:13,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:13:13,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:13:13,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:13:13,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:13:13,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:13:13,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:13:13,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:13:13,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:13:13,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (1/1) ... [2022-07-22 11:13:13,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:13:13,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:13:13,691 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-22 11:13:13,710 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-22 11:13:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:13:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:13:13,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:13:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:13:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:13:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:13:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:13:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:13:13,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:13:13,907 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:13:13,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:13:13,926 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:13:16,659 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-22 11:13:16,660 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-22 11:13:16,660 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:13:16,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:13:16,669 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:13:16,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:13:16 BoogieIcfgContainer [2022-07-22 11:13:16,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:13:16,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:13:16,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:13:16,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:13:16,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:13:13" (1/3) ... [2022-07-22 11:13:16,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e238be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:13:16, skipping insertion in model container [2022-07-22 11:13:16,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:13" (2/3) ... [2022-07-22 11:13:16,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e238be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:13:16, skipping insertion in model container [2022-07-22 11:13:16,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:13:16" (3/3) ... [2022-07-22 11:13:16,677 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-07-22 11:13:16,687 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:13:16,687 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:13:16,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:13:16,765 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@4e82a099, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d92457e [2022-07-22 11:13:16,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:13:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 11:13:16,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:16,780 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] [2022-07-22 11:13:16,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-22 11:13:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:16,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451917841] [2022-07-22 11:13:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:17,259 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-22 11:13:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:17,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451917841] [2022-07-22 11:13:17,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451917841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:17,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:17,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102250091] [2022-07-22 11:13:17,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:17,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:17,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:17,291 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:19,317 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-22 11:13:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:19,509 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-07-22 11:13:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-22 11:13:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:19,517 INFO L225 Difference]: With dead ends: 255 [2022-07-22 11:13:19,517 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 11:13:19,522 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-22 11:13:19,527 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:19,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:13:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 11:13:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-22 11:13:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-22 11:13:19,580 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-22 11:13:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:19,581 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-22 11:13:19,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-22 11:13:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 11:13:19,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:19,584 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] [2022-07-22 11:13:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:13:19,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-07-22 11:13:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:19,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767108365] [2022-07-22 11:13:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 11:13:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:19,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767108365] [2022-07-22 11:13:19,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767108365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:19,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:19,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:13:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333684703] [2022-07-22 11:13:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:19,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:13:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:13:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:19,828 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:19,862 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-07-22 11:13:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:13:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-22 11:13:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:19,868 INFO L225 Difference]: With dead ends: 321 [2022-07-22 11:13:19,868 INFO L226 Difference]: Without dead ends: 216 [2022-07-22 11:13:19,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:19,870 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 124 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:19,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 310 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:13:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-22 11:13:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-22 11:13:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4883720930232558) internal successors, (320), 215 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2022-07-22 11:13:19,891 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2022-07-22 11:13:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:19,892 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2022-07-22 11:13:19,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2022-07-22 11:13:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 11:13:19,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:19,896 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:19,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:13:19,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2022-07-22 11:13:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:19,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311139114] [2022-07-22 11:13:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 11:13:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:20,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311139114] [2022-07-22 11:13:20,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311139114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:20,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:20,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:13:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104726013] [2022-07-22 11:13:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:20,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:13:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:20,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:13:20,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:20,103 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:22,112 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-22 11:13:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:22,146 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2022-07-22 11:13:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:13:22,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 53 [2022-07-22 11:13:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:22,149 INFO L225 Difference]: With dead ends: 421 [2022-07-22 11:13:22,149 INFO L226 Difference]: Without dead ends: 316 [2022-07-22 11:13:22,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:22,150 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:22,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 11:13:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-22 11:13:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-07-22 11:13:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4825396825396826) internal successors, (467), 315 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2022-07-22 11:13:22,165 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2022-07-22 11:13:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:22,165 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2022-07-22 11:13:22,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2022-07-22 11:13:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-22 11:13:22,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:22,167 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:22,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:13:22,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2022-07-22 11:13:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:22,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819221119] [2022-07-22 11:13:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:13:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:22,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819221119] [2022-07-22 11:13:22,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819221119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:22,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:22,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:22,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940947774] [2022-07-22 11:13:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:22,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:22,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:22,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:22,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:22,350 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:24,371 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-22 11:13:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:24,648 INFO L93 Difference]: Finished difference Result 894 states and 1328 transitions. [2022-07-22 11:13:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-22 11:13:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:24,650 INFO L225 Difference]: With dead ends: 894 [2022-07-22 11:13:24,650 INFO L226 Difference]: Without dead ends: 588 [2022-07-22 11:13:24,651 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-22 11:13:24,651 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:24,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:13:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-22 11:13:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 388. [2022-07-22 11:13:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.5322997416020672) internal successors, (593), 387 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 593 transitions. [2022-07-22 11:13:24,663 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 593 transitions. Word has length 71 [2022-07-22 11:13:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:24,663 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 593 transitions. [2022-07-22 11:13:24,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 593 transitions. [2022-07-22 11:13:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 11:13:24,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:24,665 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:24,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:13:24,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2022-07-22 11:13:24,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:24,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895441975] [2022-07-22 11:13:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:24,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:13:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895441975] [2022-07-22 11:13:24,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895441975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:24,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:24,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915896977] [2022-07-22 11:13:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:24,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:24,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:24,792 INFO L87 Difference]: Start difference. First operand 388 states and 593 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:26,799 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-22 11:13:28,813 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-22 11:13:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:29,087 INFO L93 Difference]: Finished difference Result 944 states and 1441 transitions. [2022-07-22 11:13:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:29,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-22 11:13:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:29,089 INFO L225 Difference]: With dead ends: 944 [2022-07-22 11:13:29,089 INFO L226 Difference]: Without dead ends: 566 [2022-07-22 11:13:29,090 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-22 11:13:29,091 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 91 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:29,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:13:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-07-22 11:13:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 440. [2022-07-22 11:13:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.55125284738041) internal successors, (681), 439 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 681 transitions. [2022-07-22 11:13:29,111 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 681 transitions. Word has length 72 [2022-07-22 11:13:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:29,111 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 681 transitions. [2022-07-22 11:13:29,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 681 transitions. [2022-07-22 11:13:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 11:13:29,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:29,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:29,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:13:29,113 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:29,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash 91009808, now seen corresponding path program 1 times [2022-07-22 11:13:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:29,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078908124] [2022-07-22 11:13:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:13:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:29,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078908124] [2022-07-22 11:13:29,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078908124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:29,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:29,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62400915] [2022-07-22 11:13:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:29,260 INFO L87 Difference]: Start difference. First operand 440 states and 681 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:31,275 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-22 11:13:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:31,511 INFO L93 Difference]: Finished difference Result 1142 states and 1756 transitions. [2022-07-22 11:13:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:31,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-22 11:13:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:31,514 INFO L225 Difference]: With dead ends: 1142 [2022-07-22 11:13:31,514 INFO L226 Difference]: Without dead ends: 712 [2022-07-22 11:13:31,514 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-22 11:13:31,515 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:31,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:13:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-22 11:13:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 463. [2022-07-22 11:13:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.5692640692640694) internal successors, (725), 462 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 725 transitions. [2022-07-22 11:13:31,534 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 725 transitions. Word has length 72 [2022-07-22 11:13:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:31,534 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 725 transitions. [2022-07-22 11:13:31,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 725 transitions. [2022-07-22 11:13:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 11:13:31,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:31,536 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:31,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:13:31,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash -406970094, now seen corresponding path program 1 times [2022-07-22 11:13:31,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:31,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378054960] [2022-07-22 11:13:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:13:31,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:31,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378054960] [2022-07-22 11:13:31,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378054960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:31,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:31,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135395078] [2022-07-22 11:13:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:31,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:31,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:31,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:31,683 INFO L87 Difference]: Start difference. First operand 463 states and 725 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-22 11:13:33,697 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-22 11:13:35,714 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-22 11:13:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:35,975 INFO L93 Difference]: Finished difference Result 1094 states and 1703 transitions. [2022-07-22 11:13:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:35,976 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 92 [2022-07-22 11:13:35,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:35,978 INFO L225 Difference]: With dead ends: 1094 [2022-07-22 11:13:35,978 INFO L226 Difference]: Without dead ends: 641 [2022-07-22 11:13:35,979 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-22 11:13:35,979 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:35,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:13:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-22 11:13:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 509. [2022-07-22 11:13:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.580708661417323) internal successors, (803), 508 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 803 transitions. [2022-07-22 11:13:36,008 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 803 transitions. Word has length 92 [2022-07-22 11:13:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:36,009 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 803 transitions. [2022-07-22 11:13:36,009 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-22 11:13:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 803 transitions. [2022-07-22 11:13:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 11:13:36,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:36,013 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:13:36,014 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 486516244, now seen corresponding path program 1 times [2022-07-22 11:13:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:36,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345357129] [2022-07-22 11:13:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 11:13:36,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:36,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345357129] [2022-07-22 11:13:36,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345357129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:36,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:36,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343649793] [2022-07-22 11:13:36,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:36,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:36,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:36,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:36,173 INFO L87 Difference]: Start difference. First operand 509 states and 803 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:38,180 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-22 11:13:40,201 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-22 11:13:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:40,392 INFO L93 Difference]: Finished difference Result 1094 states and 1720 transitions. [2022-07-22 11:13:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 92 [2022-07-22 11:13:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:40,395 INFO L225 Difference]: With dead ends: 1094 [2022-07-22 11:13:40,395 INFO L226 Difference]: Without dead ends: 595 [2022-07-22 11:13:40,395 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-22 11:13:40,396 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:40,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 494 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:13:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-07-22 11:13:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 549. [2022-07-22 11:13:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5894160583941606) internal successors, (871), 548 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 871 transitions. [2022-07-22 11:13:40,406 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 871 transitions. Word has length 92 [2022-07-22 11:13:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:40,407 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 871 transitions. [2022-07-22 11:13:40,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 871 transitions. [2022-07-22 11:13:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 11:13:40,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:40,408 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:40,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:13:40,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:40,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:40,410 INFO L85 PathProgramCache]: Analyzing trace with hash 648309393, now seen corresponding path program 1 times [2022-07-22 11:13:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:40,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39788961] [2022-07-22 11:13:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:13:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:40,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39788961] [2022-07-22 11:13:40,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39788961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:40,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:40,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834528696] [2022-07-22 11:13:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:40,560 INFO L87 Difference]: Start difference. First operand 549 states and 871 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-22 11:13:42,570 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-22 11:13:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:42,826 INFO L93 Difference]: Finished difference Result 1285 states and 2001 transitions. [2022-07-22 11:13:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:42,826 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 93 [2022-07-22 11:13:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:42,829 INFO L225 Difference]: With dead ends: 1285 [2022-07-22 11:13:42,829 INFO L226 Difference]: Without dead ends: 746 [2022-07-22 11:13:42,829 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-22 11:13:42,830 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:42,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:13:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-22 11:13:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 549. [2022-07-22 11:13:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5784671532846715) internal successors, (865), 548 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 865 transitions. [2022-07-22 11:13:42,842 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 865 transitions. Word has length 93 [2022-07-22 11:13:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:42,842 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 865 transitions. [2022-07-22 11:13:42,843 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-22 11:13:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 865 transitions. [2022-07-22 11:13:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:13:42,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:42,844 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-07-22 11:13:42,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:13:42,844 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash 328538170, now seen corresponding path program 2 times [2022-07-22 11:13:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:42,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036446880] [2022-07-22 11:13:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:42,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036446880] [2022-07-22 11:13:42,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036446880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:42,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:42,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696276812] [2022-07-22 11:13:42,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:42,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:42,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:42,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:42,992 INFO L87 Difference]: Start difference. First operand 549 states and 865 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:45,001 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-22 11:13:47,015 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-22 11:13:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:47,247 INFO L93 Difference]: Finished difference Result 1282 states and 1986 transitions. [2022-07-22 11:13:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:47,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-22 11:13:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:47,250 INFO L225 Difference]: With dead ends: 1282 [2022-07-22 11:13:47,250 INFO L226 Difference]: Without dead ends: 743 [2022-07-22 11:13:47,251 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-22 11:13:47,251 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:47,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:13:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-07-22 11:13:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 549. [2022-07-22 11:13:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5602189781021898) internal successors, (855), 548 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 855 transitions. [2022-07-22 11:13:47,264 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 855 transitions. Word has length 106 [2022-07-22 11:13:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:47,264 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 855 transitions. [2022-07-22 11:13:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 855 transitions. [2022-07-22 11:13:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:13:47,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:47,265 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:13:47,266 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:47,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 945009752, now seen corresponding path program 1 times [2022-07-22 11:13:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:47,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732067948] [2022-07-22 11:13:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:47,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:47,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732067948] [2022-07-22 11:13:47,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732067948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:47,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:47,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:47,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262455799] [2022-07-22 11:13:47,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:47,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:47,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:47,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:47,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:47,422 INFO L87 Difference]: Start difference. First operand 549 states and 855 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:49,429 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-22 11:13:51,447 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-22 11:13:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:51,687 INFO L93 Difference]: Finished difference Result 1212 states and 1872 transitions. [2022-07-22 11:13:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-22 11:13:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:51,689 INFO L225 Difference]: With dead ends: 1212 [2022-07-22 11:13:51,689 INFO L226 Difference]: Without dead ends: 673 [2022-07-22 11:13:51,690 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-22 11:13:51,690 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 97 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:51,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 538 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:13:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-22 11:13:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 549. [2022-07-22 11:13:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5565693430656935) internal successors, (853), 548 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 853 transitions. [2022-07-22 11:13:51,701 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 853 transitions. Word has length 106 [2022-07-22 11:13:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:51,702 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 853 transitions. [2022-07-22 11:13:51,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 853 transitions. [2022-07-22 11:13:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:13:51,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:51,703 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:51,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:13:51,703 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1505709530, now seen corresponding path program 1 times [2022-07-22 11:13:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:51,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674921353] [2022-07-22 11:13:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:51,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:51,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674921353] [2022-07-22 11:13:51,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674921353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:51,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:51,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179136969] [2022-07-22 11:13:51,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:51,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:51,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:51,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:51,843 INFO L87 Difference]: Start difference. First operand 549 states and 853 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:53,850 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-22 11:13:55,868 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-22 11:13:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:56,028 INFO L93 Difference]: Finished difference Result 1132 states and 1748 transitions. [2022-07-22 11:13:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-22 11:13:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:56,037 INFO L225 Difference]: With dead ends: 1132 [2022-07-22 11:13:56,037 INFO L226 Difference]: Without dead ends: 593 [2022-07-22 11:13:56,038 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-22 11:13:56,038 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:56,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 492 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:13:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-22 11:13:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 549. [2022-07-22 11:13:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.552919708029197) internal successors, (851), 548 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 851 transitions. [2022-07-22 11:13:56,049 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 851 transitions. Word has length 106 [2022-07-22 11:13:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:56,050 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 851 transitions. [2022-07-22 11:13:56,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 851 transitions. [2022-07-22 11:13:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:13:56,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:56,051 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:56,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:13:56,052 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1643241353, now seen corresponding path program 1 times [2022-07-22 11:13:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:56,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068707715] [2022-07-22 11:13:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:56,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068707715] [2022-07-22 11:13:56,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068707715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:56,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:56,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443749618] [2022-07-22 11:13:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:56,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:56,213 INFO L87 Difference]: Start difference. First operand 549 states and 851 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:58,221 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-22 11:13:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:58,487 INFO L93 Difference]: Finished difference Result 1283 states and 1959 transitions. [2022-07-22 11:13:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:58,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-22 11:13:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:58,490 INFO L225 Difference]: With dead ends: 1283 [2022-07-22 11:13:58,490 INFO L226 Difference]: Without dead ends: 744 [2022-07-22 11:13:58,491 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-22 11:13:58,491 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 117 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:58,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 286 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:13:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-22 11:13:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 549. [2022-07-22 11:13:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5346715328467153) internal successors, (841), 548 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 841 transitions. [2022-07-22 11:13:58,504 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 841 transitions. Word has length 107 [2022-07-22 11:13:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:58,504 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 841 transitions. [2022-07-22 11:13:58,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 841 transitions. [2022-07-22 11:13:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:13:58,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:58,505 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:58,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:13:58,506 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash 521678268, now seen corresponding path program 1 times [2022-07-22 11:13:58,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:58,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643613750] [2022-07-22 11:13:58,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:58,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:58,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643613750] [2022-07-22 11:13:58,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643613750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:58,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:58,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:58,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137777458] [2022-07-22 11:13:58,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:58,635 INFO L87 Difference]: Start difference. First operand 549 states and 841 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:00,644 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-22 11:14:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:00,915 INFO L93 Difference]: Finished difference Result 1167 states and 1766 transitions. [2022-07-22 11:14:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:00,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-22 11:14:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:00,917 INFO L225 Difference]: With dead ends: 1167 [2022-07-22 11:14:00,917 INFO L226 Difference]: Without dead ends: 819 [2022-07-22 11:14:00,918 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-22 11:14:00,918 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:00,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 492 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:14:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-07-22 11:14:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 597. [2022-07-22 11:14:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.5201342281879195) internal successors, (906), 596 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 906 transitions. [2022-07-22 11:14:00,933 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 906 transitions. Word has length 107 [2022-07-22 11:14:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:00,934 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 906 transitions. [2022-07-22 11:14:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 906 transitions. [2022-07-22 11:14:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:14:00,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:00,935 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:00,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:14:00,936 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1921869643, now seen corresponding path program 1 times [2022-07-22 11:14:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:00,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095163458] [2022-07-22 11:14:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:14:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:01,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095163458] [2022-07-22 11:14:01,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095163458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:01,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:01,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430244322] [2022-07-22 11:14:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:01,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:01,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:01,089 INFO L87 Difference]: Start difference. First operand 597 states and 906 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:03,098 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-22 11:14:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:03,353 INFO L93 Difference]: Finished difference Result 1460 states and 2192 transitions. [2022-07-22 11:14:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:03,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-22 11:14:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:03,356 INFO L225 Difference]: With dead ends: 1460 [2022-07-22 11:14:03,356 INFO L226 Difference]: Without dead ends: 873 [2022-07-22 11:14:03,357 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-22 11:14:03,357 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:03,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:14:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-22 11:14:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 711. [2022-07-22 11:14:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.5380281690140845) internal successors, (1092), 710 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1092 transitions. [2022-07-22 11:14:03,373 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1092 transitions. Word has length 107 [2022-07-22 11:14:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:03,373 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1092 transitions. [2022-07-22 11:14:03,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1092 transitions. [2022-07-22 11:14:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:14:03,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:03,375 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:03,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:14:03,375 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1096338685, now seen corresponding path program 1 times [2022-07-22 11:14:03,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:03,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073684144] [2022-07-22 11:14:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:14:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:03,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073684144] [2022-07-22 11:14:03,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073684144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:03,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:03,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485602492] [2022-07-22 11:14:03,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:03,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:03,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:03,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:03,516 INFO L87 Difference]: Start difference. First operand 711 states and 1092 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-22 11:14:05,523 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-22 11:14:07,539 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-22 11:14:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:07,786 INFO L93 Difference]: Finished difference Result 1536 states and 2344 transitions. [2022-07-22 11:14:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:07,786 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 108 [2022-07-22 11:14:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:07,788 INFO L225 Difference]: With dead ends: 1536 [2022-07-22 11:14:07,788 INFO L226 Difference]: Without dead ends: 835 [2022-07-22 11:14:07,789 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-22 11:14:07,790 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 91 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:07,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 530 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:14:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-22 11:14:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 711. [2022-07-22 11:14:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.5352112676056338) internal successors, (1090), 710 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1090 transitions. [2022-07-22 11:14:07,803 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1090 transitions. Word has length 108 [2022-07-22 11:14:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:07,803 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1090 transitions. [2022-07-22 11:14:07,804 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-22 11:14:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1090 transitions. [2022-07-22 11:14:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:14:07,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:07,805 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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] [2022-07-22 11:14:07,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:14:07,805 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1722268611, now seen corresponding path program 1 times [2022-07-22 11:14:07,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:07,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940644640] [2022-07-22 11:14:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:07,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:14:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:07,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940644640] [2022-07-22 11:14:07,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940644640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:07,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:07,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638196489] [2022-07-22 11:14:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:07,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:07,933 INFO L87 Difference]: Start difference. First operand 711 states and 1090 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-22 11:14:09,947 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-22 11:14:11,967 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-22 11:14:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:12,207 INFO L93 Difference]: Finished difference Result 1285 states and 1958 transitions. [2022-07-22 11:14:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:12,207 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 108 [2022-07-22 11:14:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:12,210 INFO L225 Difference]: With dead ends: 1285 [2022-07-22 11:14:12,210 INFO L226 Difference]: Without dead ends: 829 [2022-07-22 11:14:12,210 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-22 11:14:12,211 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 85 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:12,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 524 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:14:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-07-22 11:14:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 711. [2022-07-22 11:14:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.532394366197183) internal successors, (1088), 710 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1088 transitions. [2022-07-22 11:14:12,224 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1088 transitions. Word has length 108 [2022-07-22 11:14:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:12,225 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1088 transitions. [2022-07-22 11:14:12,225 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-22 11:14:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1088 transitions. [2022-07-22 11:14:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:14:12,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:12,226 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:12,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:14:12,226 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2029459340, now seen corresponding path program 1 times [2022-07-22 11:14:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:12,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132992338] [2022-07-22 11:14:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:14:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:12,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132992338] [2022-07-22 11:14:12,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132992338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:12,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:12,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5862342] [2022-07-22 11:14:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:12,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:12,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:12,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:12,364 INFO L87 Difference]: Start difference. First operand 711 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:14,375 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-22 11:14:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:14,643 INFO L93 Difference]: Finished difference Result 1607 states and 2433 transitions. [2022-07-22 11:14:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:14,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:14:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:14,646 INFO L225 Difference]: With dead ends: 1607 [2022-07-22 11:14:14,646 INFO L226 Difference]: Without dead ends: 906 [2022-07-22 11:14:14,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:14:14,647 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:14,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:14:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-07-22 11:14:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 747. [2022-07-22 11:14:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.5509383378016086) internal successors, (1157), 746 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1157 transitions. [2022-07-22 11:14:14,662 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1157 transitions. Word has length 108 [2022-07-22 11:14:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:14,663 INFO L495 AbstractCegarLoop]: Abstraction has 747 states and 1157 transitions. [2022-07-22 11:14:14,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1157 transitions. [2022-07-22 11:14:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:14:14,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:14,664 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:14,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:14:14,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1379060519, now seen corresponding path program 1 times [2022-07-22 11:14:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:14,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970636908] [2022-07-22 11:14:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:14,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:14:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970636908] [2022-07-22 11:14:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970636908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:14,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:14,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498328839] [2022-07-22 11:14:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:14,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:14,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:14,788 INFO L87 Difference]: Start difference. First operand 747 states and 1157 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:16,795 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-22 11:14:18,814 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-22 11:14:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:19,042 INFO L93 Difference]: Finished difference Result 1598 states and 2461 transitions. [2022-07-22 11:14:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:14:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:19,045 INFO L225 Difference]: With dead ends: 1598 [2022-07-22 11:14:19,045 INFO L226 Difference]: Without dead ends: 861 [2022-07-22 11:14:19,046 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-22 11:14:19,046 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 61 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:19,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 518 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:14:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-07-22 11:14:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 779. [2022-07-22 11:14:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.5539845758354756) internal successors, (1209), 778 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1209 transitions. [2022-07-22 11:14:19,060 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1209 transitions. Word has length 108 [2022-07-22 11:14:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:19,061 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1209 transitions. [2022-07-22 11:14:19,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1209 transitions. [2022-07-22 11:14:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:14:19,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:19,062 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:19,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:14:19,063 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1237053953, now seen corresponding path program 1 times [2022-07-22 11:14:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:19,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24661703] [2022-07-22 11:14:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:14:19,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:19,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24661703] [2022-07-22 11:14:19,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24661703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:19,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:19,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414003179] [2022-07-22 11:14:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:19,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:19,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:19,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:19,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:19,177 INFO L87 Difference]: Start difference. First operand 779 states and 1209 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-22 11:14:21,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:14:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:21,426 INFO L93 Difference]: Finished difference Result 1707 states and 2603 transitions. [2022-07-22 11:14:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:21,427 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 108 [2022-07-22 11:14:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:21,429 INFO L225 Difference]: With dead ends: 1707 [2022-07-22 11:14:21,429 INFO L226 Difference]: Without dead ends: 938 [2022-07-22 11:14:21,430 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-22 11:14:21,431 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:21,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:14:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-22 11:14:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 779. [2022-07-22 11:14:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.5359897172236503) internal successors, (1195), 778 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1195 transitions. [2022-07-22 11:14:21,458 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1195 transitions. Word has length 108 [2022-07-22 11:14:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:21,459 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1195 transitions. [2022-07-22 11:14:21,459 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-22 11:14:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1195 transitions. [2022-07-22 11:14:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:14:21,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:21,460 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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] [2022-07-22 11:14:21,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:14:21,461 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 239306047, now seen corresponding path program 1 times [2022-07-22 11:14:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:21,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27217891] [2022-07-22 11:14:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:14:21,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:21,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27217891] [2022-07-22 11:14:21,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27217891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:21,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:21,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156944783] [2022-07-22 11:14:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:21,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:21,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:21,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:21,581 INFO L87 Difference]: Start difference. First operand 779 states and 1195 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-22 11:14:23,588 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-22 11:14:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:23,849 INFO L93 Difference]: Finished difference Result 1489 states and 2259 transitions. [2022-07-22 11:14:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:23,850 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 108 [2022-07-22 11:14:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:23,852 INFO L225 Difference]: With dead ends: 1489 [2022-07-22 11:14:23,852 INFO L226 Difference]: Without dead ends: 993 [2022-07-22 11:14:23,853 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-22 11:14:23,854 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 107 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:23,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 474 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:14:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-07-22 11:14:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 782. [2022-07-22 11:14:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.5236875800256082) internal successors, (1190), 781 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1190 transitions. [2022-07-22 11:14:23,881 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1190 transitions. Word has length 108 [2022-07-22 11:14:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:23,881 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1190 transitions. [2022-07-22 11:14:23,882 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-22 11:14:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1190 transitions. [2022-07-22 11:14:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:14:23,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:23,883 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:23,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:14:23,884 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1494959612, now seen corresponding path program 1 times [2022-07-22 11:14:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:23,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928199160] [2022-07-22 11:14:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:14:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:24,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928199160] [2022-07-22 11:14:24,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928199160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:24,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993939585] [2022-07-22 11:14:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:24,013 INFO L87 Difference]: Start difference. First operand 782 states and 1190 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-22 11:14:26,020 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-22 11:14:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:26,301 INFO L93 Difference]: Finished difference Result 1713 states and 2565 transitions. [2022-07-22 11:14:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:26,302 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 109 [2022-07-22 11:14:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:26,304 INFO L225 Difference]: With dead ends: 1713 [2022-07-22 11:14:26,304 INFO L226 Difference]: Without dead ends: 941 [2022-07-22 11:14:26,305 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-22 11:14:26,306 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 112 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:26,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:14:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-22 11:14:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 782. [2022-07-22 11:14:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.503201024327785) internal successors, (1174), 781 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1174 transitions. [2022-07-22 11:14:26,325 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1174 transitions. Word has length 109 [2022-07-22 11:14:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:26,326 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1174 transitions. [2022-07-22 11:14:26,326 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-22 11:14:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1174 transitions. [2022-07-22 11:14:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:14:26,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:26,327 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:26,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:14:26,327 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1195640152, now seen corresponding path program 1 times [2022-07-22 11:14:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:26,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032577297] [2022-07-22 11:14:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:14:26,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:26,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032577297] [2022-07-22 11:14:26,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032577297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:26,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:26,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409224301] [2022-07-22 11:14:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:26,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:26,471 INFO L87 Difference]: Start difference. First operand 782 states and 1174 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:28,483 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-22 11:14:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:28,722 INFO L93 Difference]: Finished difference Result 1713 states and 2533 transitions. [2022-07-22 11:14:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:28,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-22 11:14:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:28,725 INFO L225 Difference]: With dead ends: 1713 [2022-07-22 11:14:28,725 INFO L226 Difference]: Without dead ends: 941 [2022-07-22 11:14:28,726 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-22 11:14:28,726 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:28,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:14:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-22 11:14:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 788. [2022-07-22 11:14:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.5031766200762389) internal successors, (1183), 787 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1183 transitions. [2022-07-22 11:14:28,742 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1183 transitions. Word has length 109 [2022-07-22 11:14:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:28,742 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1183 transitions. [2022-07-22 11:14:28,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1183 transitions. [2022-07-22 11:14:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 11:14:28,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:28,744 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:28,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 11:14:28,744 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1791034879, now seen corresponding path program 1 times [2022-07-22 11:14:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:28,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526163181] [2022-07-22 11:14:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:14:28,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:28,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526163181] [2022-07-22 11:14:28,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526163181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:28,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:28,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:28,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195579834] [2022-07-22 11:14:28,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:28,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:28,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:28,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:28,897 INFO L87 Difference]: Start difference. First operand 788 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:30,904 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-22 11:14:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:31,142 INFO L93 Difference]: Finished difference Result 1719 states and 2539 transitions. [2022-07-22 11:14:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-22 11:14:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:31,145 INFO L225 Difference]: With dead ends: 1719 [2022-07-22 11:14:31,145 INFO L226 Difference]: Without dead ends: 941 [2022-07-22 11:14:31,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:14:31,146 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:31,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:14:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-22 11:14:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 788. [2022-07-22 11:14:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4891994917407878) internal successors, (1172), 787 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1172 transitions. [2022-07-22 11:14:31,177 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1172 transitions. Word has length 110 [2022-07-22 11:14:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:31,178 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1172 transitions. [2022-07-22 11:14:31,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1172 transitions. [2022-07-22 11:14:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 11:14:31,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:31,179 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:31,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 11:14:31,180 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1059618658, now seen corresponding path program 1 times [2022-07-22 11:14:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:31,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976342142] [2022-07-22 11:14:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:14:31,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:31,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976342142] [2022-07-22 11:14:31,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976342142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:31,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:31,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:14:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703976036] [2022-07-22 11:14:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:31,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:14:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:14:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:14:31,332 INFO L87 Difference]: Start difference. First operand 788 states and 1172 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:33,340 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-22 11:14:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:33,573 INFO L93 Difference]: Finished difference Result 1710 states and 2505 transitions. [2022-07-22 11:14:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:14:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 110 [2022-07-22 11:14:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:33,576 INFO L225 Difference]: With dead ends: 1710 [2022-07-22 11:14:33,576 INFO L226 Difference]: Without dead ends: 929 [2022-07-22 11:14:33,576 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-22 11:14:33,577 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:33,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:14:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-07-22 11:14:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 794. [2022-07-22 11:14:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.489281210592686) internal successors, (1181), 793 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1181 transitions. [2022-07-22 11:14:33,597 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1181 transitions. Word has length 110 [2022-07-22 11:14:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:33,597 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1181 transitions. [2022-07-22 11:14:33,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1181 transitions. [2022-07-22 11:14:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 11:14:33,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:33,599 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:33,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 11:14:33,599 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2086535811, now seen corresponding path program 1 times [2022-07-22 11:14:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:33,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502130699] [2022-07-22 11:14:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-22 11:14:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:14:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502130699] [2022-07-22 11:14:33,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502130699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:33,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:33,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:14:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920993317] [2022-07-22 11:14:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:33,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:14:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:14:33,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:14:33,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:14:33,752 INFO L87 Difference]: Start difference. First operand 794 states and 1181 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-22 11:14:35,757 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-22 11:14:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:35,816 INFO L93 Difference]: Finished difference Result 1578 states and 2354 transitions. [2022-07-22 11:14:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:14:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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 110 [2022-07-22 11:14:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:35,819 INFO L225 Difference]: With dead ends: 1578 [2022-07-22 11:14:35,819 INFO L226 Difference]: Without dead ends: 1074 [2022-07-22 11:14:35,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:14:35,820 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:35,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 468 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 11:14:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-07-22 11:14:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2022-07-22 11:14:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 1.4874184529356944) internal successors, (1596), 1073 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1596 transitions. [2022-07-22 11:14:35,839 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1596 transitions. Word has length 110 [2022-07-22 11:14:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:35,839 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1596 transitions. [2022-07-22 11:14:35,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-22 11:14:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1596 transitions. [2022-07-22 11:14:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 11:14:35,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:35,841 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 11:14:35,842 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2022-07-22 11:14:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:14:35,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305224865] [2022-07-22 11:14:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:14:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:14:36,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:14:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:14:36,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:14:36,847 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:14:36,848 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:14:36,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 11:14:36,853 INFO L356 BasicCegarLoop]: Path program histogram: [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-22 11:14:36,856 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:14:36,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:14:36 BoogieIcfgContainer [2022-07-22 11:14:36,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:14:36,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:14:36,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:14:36,950 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:14:36,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:13:16" (3/4) ... [2022-07-22 11:14:36,953 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 11:14:36,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:14:36,954 INFO L158 Benchmark]: Toolchain (without parser) took 83799.24ms. Allocated memory was 109.1MB in the beginning and 209.7MB in the end (delta: 100.7MB). Free memory was 77.5MB in the beginning and 84.7MB in the end (delta: -7.2MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2022-07-22 11:14:36,954 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:14:36,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.97ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 77.5MB in the beginning and 92.7MB in the end (delta: -15.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 11:14:36,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.13ms. Allocated memory is still 136.3MB. Free memory was 92.7MB in the beginning and 88.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:14:36,956 INFO L158 Benchmark]: Boogie Preprocessor took 41.80ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 81.3MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 11:14:36,956 INFO L158 Benchmark]: RCFGBuilder took 3028.33ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 50.4MB in the end (delta: 31.0MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2022-07-22 11:14:36,959 INFO L158 Benchmark]: TraceAbstraction took 80277.07ms. Allocated memory was 136.3MB in the beginning and 209.7MB in the end (delta: 73.4MB). Free memory was 50.3MB in the beginning and 85.8MB in the end (delta: -35.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2022-07-22 11:14:36,959 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 209.7MB. Free memory was 85.8MB in the beginning and 84.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:14:36,961 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.17ms. Allocated memory is still 109.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.97ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 77.5MB in the beginning and 92.7MB in the end (delta: -15.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.13ms. Allocated memory is still 136.3MB. Free memory was 92.7MB in the beginning and 88.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.80ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 81.3MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3028.33ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 50.4MB in the end (delta: 31.0MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * TraceAbstraction took 80277.07ms. Allocated memory was 136.3MB in the beginning and 209.7MB in the end (delta: 73.4MB). Free memory was 50.3MB in the beginning and 85.8MB in the end (delta: -35.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 209.7MB. Free memory was 85.8MB in the beginning and 84.7MB in the end (delta: 1.0MB). 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: 1665]: 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 1356. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=-6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:11}, s->wbio={0:-13}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(s->hit) [L1350] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1352] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1356] EXPR s->s3 [L1356] EXPR (s->s3)->tmp.new_cipher [L1356] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967345, (s->s3)->tmp.new_cipher={-7:0}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1359] ret = __VERIFIER_nondet_int() [L1360] COND TRUE blastFlag == 2 [L1361] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.1s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 74.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 2438 SdHoareTripleChecker+Valid, 73.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2438 mSDsluCounter, 10164 SdHoareTripleChecker+Invalid, 72.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5840 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4734 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 4324 mSDtfsCounter, 4734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1074occurred in iteration=26, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 3345 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2554 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2416 ConstructedInterpolants, 0 QuantifiedInterpolants, 6030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 2491/2491 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-22 11:14:36,997 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_clnt.blast.04.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:14:38,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:14:38,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:14:38,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:14:38,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:14:38,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:14:38,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:14:38,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:14:38,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:14:38,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:14:38,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:14:38,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:14:38,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:14:38,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:14:38,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:14:38,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:14:38,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:14:38,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:14:38,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:14:38,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:14:38,634 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:14:38,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:14:38,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:14:38,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:14:38,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:14:38,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:14:38,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:14:38,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:14:38,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:14:38,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:14:38,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:14:38,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:14:38,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:14:38,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:14:38,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:14:38,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:14:38,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:14:38,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:14:38,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:14:38,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:14:38,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:14:38,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:14:38,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 11:14:38,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:14:38,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:14:38,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:14:38,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:14:38,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:14:38,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:14:38,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:14:38,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:14:38,687 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:14:38,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:14:38,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:14:38,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:14:38,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:14:38,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:14:38,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:14:38,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:14:38,689 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 11:14:38,689 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 11:14:38,689 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 11:14:38,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:14:38,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:14:38,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:14:38,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:14:38,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:14:38,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:14:38,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:14:38,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:14:38,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:14:38,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:14:38,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:14:38,691 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 11:14:38,691 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 11:14:38,692 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:14:38,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:14:38,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:14:38,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 11:14:38,692 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 -> 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 [2022-07-22 11:14:38,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:14:38,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:14:38,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:14:38,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:14:38,970 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:14:38,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-22 11:14:39,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33fcea693/635735e7ea4c4c399dbbccba7130cc75/FLAGd1b26982e [2022-07-22 11:14:39,467 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:14:39,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-22 11:14:39,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33fcea693/635735e7ea4c4c399dbbccba7130cc75/FLAGd1b26982e [2022-07-22 11:14:39,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33fcea693/635735e7ea4c4c399dbbccba7130cc75 [2022-07-22 11:14:39,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:14:39,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:14:39,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:14:39,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:14:39,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:14:39,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:14:39" (1/1) ... [2022-07-22 11:14:39,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e1ae28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:39, skipping insertion in model container [2022-07-22 11:14:39,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:14:39" (1/1) ... [2022-07-22 11:14:39,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:14:39,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:14:40,144 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_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-22 11:14:40,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:14:40,163 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 11:14:40,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:14:40,250 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_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-22 11:14:40,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:14:40,275 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:14:40,357 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_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-22 11:14:40,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:14:40,374 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:14:40,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40 WrapperNode [2022-07-22 11:14:40,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:14:40,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:14:40,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:14:40,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:14:40,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,438 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-07-22 11:14:40,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:14:40,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:14:40,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:14:40,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:14:40,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:14:40,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:14:40,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:14:40,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:14:40,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (1/1) ... [2022-07-22 11:14:40,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:14:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:14:40,579 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-22 11:14:40,602 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-22 11:14:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:14:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 11:14:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:14:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 11:14:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:14:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:14:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:14:40,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:14:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 11:14:40,783 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:14:40,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:14:40,793 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:14:47,721 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-22 11:14:47,721 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-22 11:14:47,721 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:14:47,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:14:47,726 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:14:47,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:14:47 BoogieIcfgContainer [2022-07-22 11:14:47,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:14:47,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:14:47,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:14:47,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:14:47,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:14:39" (1/3) ... [2022-07-22 11:14:47,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7b0cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:14:47, skipping insertion in model container [2022-07-22 11:14:47,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:14:40" (2/3) ... [2022-07-22 11:14:47,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7b0cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:14:47, skipping insertion in model container [2022-07-22 11:14:47,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:14:47" (3/3) ... [2022-07-22 11:14:47,732 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-07-22 11:14:47,741 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:14:47,741 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:14:47,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:14:47,795 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@1f6308c5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9d138c6 [2022-07-22 11:14:47,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:14:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 11:14:47,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:47,804 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] [2022-07-22 11:14:47,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-22 11:14:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:14:47,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227941781] [2022-07-22 11:14:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:47,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:14:47,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:14:47,823 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-22 11:14:47,826 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-22 11:14:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:48,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:14:48,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:14:48,577 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-22 11:14:48,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:14:48,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:14:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227941781] [2022-07-22 11:14:48,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227941781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:48,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:48,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:14:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583953747] [2022-07-22 11:14:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:48,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:14:48,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:14:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:14:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:14:48,599 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:48,705 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2022-07-22 11:14:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:14:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-22 11:14:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:48,717 INFO L225 Difference]: With dead ends: 369 [2022-07-22 11:14:48,717 INFO L226 Difference]: Without dead ends: 213 [2022-07-22 11:14:48,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-22 11:14:48,724 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 180 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:48,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:14:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-22 11:14:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-07-22 11:14:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-07-22 11:14:48,757 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-07-22 11:14:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:48,757 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-07-22 11:14:48,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-07-22 11:14:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 11:14:48,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:48,759 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] [2022-07-22 11:14:48,779 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-22 11:14:48,963 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-22 11:14:48,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2022-07-22 11:14:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:14:48,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197909384] [2022-07-22 11:14:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:48,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:14:48,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:14:48,971 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-22 11:14:48,972 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-22 11:14:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:49,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:14:49,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:14:49,732 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-22 11:14:49,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:14:49,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:14:49,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197909384] [2022-07-22 11:14:49,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197909384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:49,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:49,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:14:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108073139] [2022-07-22 11:14:49,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:49,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:14:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:14:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:14:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:14:49,735 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:51,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:14:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:51,872 INFO L93 Difference]: Finished difference Result 418 states and 628 transitions. [2022-07-22 11:14:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:14:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-07-22 11:14:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:51,874 INFO L225 Difference]: With dead ends: 418 [2022-07-22 11:14:51,874 INFO L226 Difference]: Without dead ends: 313 [2022-07-22 11:14:51,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-22 11:14:51,875 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:51,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 11:14:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-22 11:14:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-07-22 11:14:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4871794871794872) internal successors, (464), 312 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 464 transitions. [2022-07-22 11:14:51,890 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 464 transitions. Word has length 39 [2022-07-22 11:14:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:51,890 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 464 transitions. [2022-07-22 11:14:51,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 464 transitions. [2022-07-22 11:14:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:14:51,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:51,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:51,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-22 11:14:52,108 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-22 11:14:52,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1701754597, now seen corresponding path program 1 times [2022-07-22 11:14:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:14:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045575819] [2022-07-22 11:14:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:14:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:14:52,115 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-22 11:14:52,116 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-22 11:14:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:52,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:14:52,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:14:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 11:14:52,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:14:52,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:14:52,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045575819] [2022-07-22 11:14:52,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045575819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:52,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:52,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:14:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783584857] [2022-07-22 11:14:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:52,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:14:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:14:52,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:14:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:14:52,931 INFO L87 Difference]: Start difference. First operand 313 states and 464 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:54,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:14:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:55,031 INFO L93 Difference]: Finished difference Result 619 states and 923 transitions. [2022-07-22 11:14:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:14:55,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-22 11:14:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:55,034 INFO L225 Difference]: With dead ends: 619 [2022-07-22 11:14:55,034 INFO L226 Difference]: Without dead ends: 414 [2022-07-22 11:14:55,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-22 11:14:55,036 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:55,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 468 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 11:14:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-22 11:14:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-22 11:14:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4842615012106537) internal successors, (613), 413 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-07-22 11:14:55,050 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-07-22 11:14:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:55,051 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-07-22 11:14:55,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-07-22 11:14:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 11:14:55,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:55,054 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:55,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:14:55,271 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-22 11:14:55,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -998738617, now seen corresponding path program 1 times [2022-07-22 11:14:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:14:55,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539026326] [2022-07-22 11:14:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:55,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:14:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:14:55,287 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-22 11:14:55,288 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-22 11:14:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:56,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:14:56,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:14:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 11:14:56,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:14:56,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:14:56,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539026326] [2022-07-22 11:14:56,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539026326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:14:56,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:14:56,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:14:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073981582] [2022-07-22 11:14:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:14:56,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:14:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:14:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:14:56,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:14:56,157 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:58,172 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-22 11:14:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:14:58,263 INFO L93 Difference]: Finished difference Result 821 states and 1222 transitions. [2022-07-22 11:14:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:14:58,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-22 11:14:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:14:58,282 INFO L225 Difference]: With dead ends: 821 [2022-07-22 11:14:58,282 INFO L226 Difference]: Without dead ends: 515 [2022-07-22 11:14:58,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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-22 11:14:58,283 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:14:58,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 11:14:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-22 11:14:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-07-22 11:14:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.482490272373541) internal successors, (762), 514 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-07-22 11:14:58,308 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-07-22 11:14:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:14:58,309 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-07-22 11:14:58,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:14:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-07-22 11:14:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 11:14:58,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:14:58,313 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:14:58,339 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-22 11:14:58,531 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-22 11:14:58,531 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:14:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:14:58,532 INFO L85 PathProgramCache]: Analyzing trace with hash 465583256, now seen corresponding path program 1 times [2022-07-22 11:14:58,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:14:58,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640324731] [2022-07-22 11:14:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:14:58,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:14:58,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:14:58,536 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-22 11:14:58,538 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-22 11:14:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:14:59,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 11:14:59,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:15:02,012 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-22 11:15:02,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1482 treesize of output 1090 [2022-07-22 11:15:15,544 WARN L233 SmtUtils]: Spent 13.42s on a formula simplification. DAG size of input: 205 DAG size of output: 93 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 11:15:15,544 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-22 11:15:15,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 4790 treesize of output 4750 [2022-07-22 11:15:15,614 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 4345 treesize of output 3031 [2022-07-22 11:15:16,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 11:15:16,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2466 treesize of output 1710 [2022-07-22 11:15:16,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 11:15:16,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 968 treesize of output 891 [2022-07-22 11:15:17,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:17,988 INFO L244 Elim1Store]: Index analysis took 664 ms [2022-07-22 11:15:19,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 87 [2022-07-22 11:15:19,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:19,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:20,216 INFO L244 Elim1Store]: Index analysis took 688 ms [2022-07-22 11:15:20,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-22 11:15:21,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:15:21,928 INFO L244 Elim1Store]: Index analysis took 589 ms [2022-07-22 11:15:22,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-22 11:15:22,864 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 431 treesize of output 371 [2022-07-22 11:15:23,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 143 treesize of output 123 [2022-07-22 11:15:23,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 135 treesize of output 115