./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:47:39,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:47:39,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:47:39,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:47:39,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:47:39,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:47:39,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:47:39,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:47:39,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:47:39,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:47:39,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:47:39,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:47:39,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:47:39,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:47:39,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:47:39,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:47:39,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:47:39,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:47:39,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:47:39,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:47:39,790 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:47:39,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:47:39,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:47:39,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:47:39,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:47:39,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:47:39,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:47:39,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:47:39,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:47:39,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:47:39,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:47:39,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:47:39,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:47:39,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:47:39,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:47:39,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:47:39,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:47:39,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:47:39,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:47:39,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:47:39,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:47:39,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:47:39,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:47:39,826 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:47:39,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:47:39,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:47:39,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:47:39,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:47:39,828 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:47:39,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:47:39,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:47:39,829 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:47:39,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:47:39,830 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:47:39,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:47:39,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:47:39,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:47:39,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:47:39,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:47:39,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:47:39,831 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:47:39,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:47:39,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:47:39,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:47:39,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:47:39,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:47:39,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:47:39,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:39,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:47:39,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:47:39,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:47:39,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:47:39,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:47:39,833 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:47:39,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:47:39,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:47:39,833 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 -> 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 [2022-07-11 23:47:40,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:47:40,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:47:40,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:47:40,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:47:40,045 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:47:40,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-11 23:47:40,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9aef521/2eae6edb01144ba88de8e1768667fec1/FLAGa616975b4 [2022-07-11 23:47:40,497 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:47:40,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-11 23:47:40,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9aef521/2eae6edb01144ba88de8e1768667fec1/FLAGa616975b4 [2022-07-11 23:47:40,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9aef521/2eae6edb01144ba88de8e1768667fec1 [2022-07-11 23:47:40,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:47:40,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:47:40,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:40,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:47:40,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:47:40,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:40" (1/1) ... [2022-07-11 23:47:40,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cf3655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:40, skipping insertion in model container [2022-07-11 23:47:40,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:40" (1/1) ... [2022-07-11 23:47:40,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:47:40,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:47:41,191 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.01.i.cil-2.c[65520,65533] [2022-07-11 23:47:41,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:41,223 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:47:41,305 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.01.i.cil-2.c[65520,65533] [2022-07-11 23:47:41,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:41,324 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:47:41,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41 WrapperNode [2022-07-11 23:47:41,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:41,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:41,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:47:41,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:47:41,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,414 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 724 [2022-07-11 23:47:41,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:41,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:47:41,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:47:41,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:47:41,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:47:41,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:47:41,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:47:41,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:47:41,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (1/1) ... [2022-07-11 23:47:41,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:41,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:47:41,503 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-11 23:47:41,527 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-11 23:47:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:47:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:47:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:47:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:47:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:47:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:47:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:47:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:47:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:47:41,643 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:47:41,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:47:41,654 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:44,205 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-11 23:47:44,206 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-11 23:47:44,206 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:47:44,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:47:44,214 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:47:44,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:44 BoogieIcfgContainer [2022-07-11 23:47:44,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:47:44,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:47:44,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:47:44,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:47:44,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:47:40" (1/3) ... [2022-07-11 23:47:44,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc95699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:44, skipping insertion in model container [2022-07-11 23:47:44,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:41" (2/3) ... [2022-07-11 23:47:44,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc95699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:44, skipping insertion in model container [2022-07-11 23:47:44,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:44" (3/3) ... [2022-07-11 23:47:44,225 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-07-11 23:47:44,236 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:47:44,236 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:47:44,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:47:44,293 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@315231c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37c52ebc [2022-07-11 23:47:44,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:47:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:47:44,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:44,303 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-11 23:47:44,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:44,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-11 23:47:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:44,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258128788] [2022-07-11 23:47:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:44,827 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-11 23:47:44,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:44,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258128788] [2022-07-11 23:47:44,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258128788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:44,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:44,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551320079] [2022-07-11 23:47:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:44,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:44,861 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 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-11 23:47:46,885 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-11 23:47:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:47,263 INFO L93 Difference]: Finished difference Result 365 states and 610 transitions. [2022-07-11 23:47:47,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:47,265 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-11 23:47:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:47,272 INFO L225 Difference]: With dead ends: 365 [2022-07-11 23:47:47,272 INFO L226 Difference]: Without dead ends: 208 [2022-07-11 23:47:47,274 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-11 23:47:47,277 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 143 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:47,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 381 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:47:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-11 23:47:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 138. [2022-07-11 23:47:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 137 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 213 transitions. [2022-07-11 23:47:47,323 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 213 transitions. Word has length 24 [2022-07-11 23:47:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:47,323 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 213 transitions. [2022-07-11 23:47:47,323 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-11 23:47:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 213 transitions. [2022-07-11 23:47:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-11 23:47:47,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:47,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:47,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:47:47,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2051399350, now seen corresponding path program 1 times [2022-07-11 23:47:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499947702] [2022-07-11 23:47:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:47,492 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-11 23:47:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499947702] [2022-07-11 23:47:47,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499947702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:47,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:47,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:47,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107196470] [2022-07-11 23:47:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:47,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:47,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:47,496 INFO L87 Difference]: Start difference. First operand 138 states and 213 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:49,523 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-11 23:47:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:49,769 INFO L93 Difference]: Finished difference Result 363 states and 558 transitions. [2022-07-11 23:47:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-07-11 23:47:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:49,771 INFO L225 Difference]: With dead ends: 363 [2022-07-11 23:47:49,771 INFO L226 Difference]: Without dead ends: 232 [2022-07-11 23:47:49,772 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-11 23:47:49,772 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 109 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:49,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:47:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-11 23:47:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 163. [2022-07-11 23:47:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5864197530864197) internal successors, (257), 162 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 257 transitions. [2022-07-11 23:47:49,781 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 257 transitions. Word has length 25 [2022-07-11 23:47:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:49,782 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 257 transitions. [2022-07-11 23:47:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 257 transitions. [2022-07-11 23:47:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:47:49,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:49,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:49,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:47:49,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash -835386660, now seen corresponding path program 1 times [2022-07-11 23:47:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:49,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517600387] [2022-07-11 23:47:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:49,937 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-11 23:47:49,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:49,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517600387] [2022-07-11 23:47:49,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517600387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:49,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:49,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359235558] [2022-07-11 23:47:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:49,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:49,940 INFO L87 Difference]: Start difference. First operand 163 states and 257 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:51,953 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-11 23:47:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:52,076 INFO L93 Difference]: Finished difference Result 323 states and 508 transitions. [2022-07-11 23:47:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-11 23:47:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:52,078 INFO L225 Difference]: With dead ends: 323 [2022-07-11 23:47:52,078 INFO L226 Difference]: Without dead ends: 167 [2022-07-11 23:47:52,079 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-11 23:47:52,080 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 7 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:52,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 409 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:47:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-11 23:47:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2022-07-11 23:47:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 165 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 260 transitions. [2022-07-11 23:47:52,087 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 260 transitions. Word has length 26 [2022-07-11 23:47:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:52,087 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 260 transitions. [2022-07-11 23:47:52,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 260 transitions. [2022-07-11 23:47:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:47:52,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:52,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:52,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:47:52,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -747175225, now seen corresponding path program 1 times [2022-07-11 23:47:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:52,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935333530] [2022-07-11 23:47:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:52,234 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-11 23:47:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:52,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935333530] [2022-07-11 23:47:52,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935333530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:52,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:52,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394637103] [2022-07-11 23:47:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:52,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:52,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:52,237 INFO L87 Difference]: Start difference. First operand 166 states and 260 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-11 23:47:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:52,254 INFO L93 Difference]: Finished difference Result 474 states and 748 transitions. [2022-07-11 23:47:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:52,254 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 41 [2022-07-11 23:47:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:52,255 INFO L225 Difference]: With dead ends: 474 [2022-07-11 23:47:52,255 INFO L226 Difference]: Without dead ends: 318 [2022-07-11 23:47:52,256 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-11 23:47:52,257 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 123 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 314 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-11 23:47:52,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 314 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:47:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-11 23:47:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-07-11 23:47:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.5646687697160884) internal successors, (496), 317 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 496 transitions. [2022-07-11 23:47:52,267 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 496 transitions. Word has length 41 [2022-07-11 23:47:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:52,267 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 496 transitions. [2022-07-11 23:47:52,267 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-11 23:47:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 496 transitions. [2022-07-11 23:47:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-11 23:47:52,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:52,269 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, 1, 1, 1] [2022-07-11 23:47:52,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:47:52,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196731, now seen corresponding path program 1 times [2022-07-11 23:47:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423725536] [2022-07-11 23:47:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:52,409 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-11 23:47:52,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:52,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423725536] [2022-07-11 23:47:52,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423725536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:52,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:52,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878199285] [2022-07-11 23:47:52,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:52,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:52,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:52,412 INFO L87 Difference]: Start difference. First operand 318 states and 496 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:54,418 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-11 23:47:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:54,467 INFO L93 Difference]: Finished difference Result 625 states and 983 transitions. [2022-07-11 23:47:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:54,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-11 23:47:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:54,469 INFO L225 Difference]: With dead ends: 625 [2022-07-11 23:47:54,469 INFO L226 Difference]: Without dead ends: 469 [2022-07-11 23:47:54,470 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-11 23:47:54,470 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 124 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 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.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:54,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:47:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-07-11 23:47:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-07-11 23:47:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.561965811965812) internal successors, (731), 468 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 731 transitions. [2022-07-11 23:47:54,497 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 731 transitions. Word has length 56 [2022-07-11 23:47:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:54,497 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 731 transitions. [2022-07-11 23:47:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-07-11 23:47:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-11 23:47:54,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:54,500 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, 1, 1] [2022-07-11 23:47:54,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:47:54,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:54,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2022-07-11 23:47:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:54,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322065524] [2022-07-11 23:47:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:54,626 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-11 23:47:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:54,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322065524] [2022-07-11 23:47:54,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322065524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:54,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:54,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090240741] [2022-07-11 23:47:54,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:54,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:54,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:54,629 INFO L87 Difference]: Start difference. First operand 469 states and 731 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:56,643 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-11 23:47:58,657 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-11 23:47:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:58,946 INFO L93 Difference]: Finished difference Result 1110 states and 1718 transitions. [2022-07-11 23:47:58,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:58,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-11 23:47:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:58,948 INFO L225 Difference]: With dead ends: 1110 [2022-07-11 23:47:58,949 INFO L226 Difference]: Without dead ends: 651 [2022-07-11 23:47:58,949 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-11 23:47:58,950 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 91 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 560 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-11 23:47:58,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 560 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:47:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-07-11 23:47:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 523. [2022-07-11 23:47:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.5727969348659003) internal successors, (821), 522 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 821 transitions. [2022-07-11 23:47:58,960 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 821 transitions. Word has length 74 [2022-07-11 23:47:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:58,960 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 821 transitions. [2022-07-11 23:47:58,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 821 transitions. [2022-07-11 23:47:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-11 23:47:58,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:58,962 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, 1, 1] [2022-07-11 23:47:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:47:58,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:58,963 INFO L85 PathProgramCache]: Analyzing trace with hash 537196209, now seen corresponding path program 1 times [2022-07-11 23:47:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:58,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699248170] [2022-07-11 23:47:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:59,117 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-11 23:47:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:59,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699248170] [2022-07-11 23:47:59,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699248170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:59,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:59,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107349399] [2022-07-11 23:47:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:59,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:59,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:59,120 INFO L87 Difference]: Start difference. First operand 523 states and 821 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:01,127 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-11 23:48:03,148 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-11 23:48:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:03,343 INFO L93 Difference]: Finished difference Result 1120 states and 1753 transitions. [2022-07-11 23:48:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:03,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-11 23:48:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:03,345 INFO L225 Difference]: With dead ends: 1120 [2022-07-11 23:48:03,345 INFO L226 Difference]: Without dead ends: 607 [2022-07-11 23:48:03,346 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-11 23:48:03,346 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 38 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 496 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-11 23:48:03,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 496 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:48:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-07-11 23:48:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 563. [2022-07-11 23:48:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.5818505338078293) internal successors, (889), 562 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 889 transitions. [2022-07-11 23:48:03,357 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 889 transitions. Word has length 74 [2022-07-11 23:48:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:03,357 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 889 transitions. [2022-07-11 23:48:03,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 889 transitions. [2022-07-11 23:48:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-11 23:48:03,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:03,359 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, 1, 1, 1] [2022-07-11 23:48:03,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:48:03,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2022-07-11 23:48:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:03,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115618505] [2022-07-11 23:48:03,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:03,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:03,518 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-11 23:48:03,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:03,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115618505] [2022-07-11 23:48:03,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115618505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:03,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:03,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945684561] [2022-07-11 23:48:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:03,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:03,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:03,520 INFO L87 Difference]: Start difference. First operand 563 states and 889 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:05,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:05,778 INFO L93 Difference]: Finished difference Result 1316 states and 2040 transitions. [2022-07-11 23:48:05,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:05,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-07-11 23:48:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:05,783 INFO L225 Difference]: With dead ends: 1316 [2022-07-11 23:48:05,783 INFO L226 Difference]: Without dead ends: 763 [2022-07-11 23:48:05,784 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-11 23:48:05,785 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 105 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 270 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-11 23:48:05,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-07-11 23:48:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 569. [2022-07-11 23:48:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5809859154929577) internal successors, (898), 568 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 898 transitions. [2022-07-11 23:48:05,798 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 898 transitions. Word has length 75 [2022-07-11 23:48:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:05,798 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 898 transitions. [2022-07-11 23:48:05,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 898 transitions. [2022-07-11 23:48:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 23:48:05,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:05,800 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:05,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:48:05,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash -729811888, now seen corresponding path program 2 times [2022-07-11 23:48:05,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:05,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40312506] [2022-07-11 23:48:05,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:05,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:05,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:05,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40312506] [2022-07-11 23:48:05,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40312506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:05,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:05,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539271433] [2022-07-11 23:48:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:05,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:05,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:05,947 INFO L87 Difference]: Start difference. First operand 569 states and 898 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:07,959 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-11 23:48:09,974 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-11 23:48:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:10,213 INFO L93 Difference]: Finished difference Result 1319 states and 2043 transitions. [2022-07-11 23:48:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:10,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-07-11 23:48:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:10,216 INFO L225 Difference]: With dead ends: 1319 [2022-07-11 23:48:10,216 INFO L226 Difference]: Without dead ends: 760 [2022-07-11 23:48:10,217 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-11 23:48:10,217 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 112 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 288 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-11 23:48:10,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 288 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:48:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-07-11 23:48:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 569. [2022-07-11 23:48:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5633802816901408) internal successors, (888), 568 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 888 transitions. [2022-07-11 23:48:10,230 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 888 transitions. Word has length 89 [2022-07-11 23:48:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:10,231 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 888 transitions. [2022-07-11 23:48:10,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 888 transitions. [2022-07-11 23:48:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 23:48:10,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:10,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:10,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:48:10,236 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1477837842, now seen corresponding path program 1 times [2022-07-11 23:48:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:10,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778698355] [2022-07-11 23:48:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:10,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778698355] [2022-07-11 23:48:10,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778698355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:10,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:10,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489622639] [2022-07-11 23:48:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:10,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:10,379 INFO L87 Difference]: Start difference. First operand 569 states and 888 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:12,387 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-11 23:48:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:12,647 INFO L93 Difference]: Finished difference Result 1320 states and 2024 transitions. [2022-07-11 23:48:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:12,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-07-11 23:48:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:12,649 INFO L225 Difference]: With dead ends: 1320 [2022-07-11 23:48:12,650 INFO L226 Difference]: Without dead ends: 761 [2022-07-11 23:48:12,650 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-11 23:48:12,651 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 270 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-11 23:48:12,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-07-11 23:48:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 569. [2022-07-11 23:48:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.545774647887324) internal successors, (878), 568 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 878 transitions. [2022-07-11 23:48:12,662 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 878 transitions. Word has length 89 [2022-07-11 23:48:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:12,663 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 878 transitions. [2022-07-11 23:48:12,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 878 transitions. [2022-07-11 23:48:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 23:48:12,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:12,664 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-11 23:48:12,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:48:12,665 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash -859117231, now seen corresponding path program 1 times [2022-07-11 23:48:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:12,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34219215] [2022-07-11 23:48:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:12,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:12,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34219215] [2022-07-11 23:48:12,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34219215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:12,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:12,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:12,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366535005] [2022-07-11 23:48:12,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:12,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:12,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:12,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:12,790 INFO L87 Difference]: Start difference. First operand 569 states and 878 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:14,798 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-11 23:48:16,826 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-11 23:48:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:17,059 INFO L93 Difference]: Finished difference Result 1045 states and 1596 transitions. [2022-07-11 23:48:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:17,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-07-11 23:48:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:17,062 INFO L225 Difference]: With dead ends: 1045 [2022-07-11 23:48:17,062 INFO L226 Difference]: Without dead ends: 685 [2022-07-11 23:48:17,062 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-11 23:48:17,063 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 92 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:17,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 544 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:48:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-07-11 23:48:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 569. [2022-07-11 23:48:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5422535211267605) internal successors, (876), 568 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 876 transitions. [2022-07-11 23:48:17,072 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 876 transitions. Word has length 89 [2022-07-11 23:48:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:17,073 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 876 transitions. [2022-07-11 23:48:17,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 876 transitions. [2022-07-11 23:48:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 23:48:17,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:17,074 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-11 23:48:17,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:48:17,074 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash -435470509, now seen corresponding path program 1 times [2022-07-11 23:48:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:17,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287633485] [2022-07-11 23:48:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:17,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:17,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287633485] [2022-07-11 23:48:17,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287633485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:17,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:17,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113515770] [2022-07-11 23:48:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:17,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:17,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:17,199 INFO L87 Difference]: Start difference. First operand 569 states and 876 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:19,207 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-11 23:48:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:19,471 INFO L93 Difference]: Finished difference Result 1202 states and 1825 transitions. [2022-07-11 23:48:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:19,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-07-11 23:48:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:19,474 INFO L225 Difference]: With dead ends: 1202 [2022-07-11 23:48:19,474 INFO L226 Difference]: Without dead ends: 842 [2022-07-11 23:48:19,475 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-11 23:48:19,476 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 114 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 498 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.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:19,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 498 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-11 23:48:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 617. [2022-07-11 23:48:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.530844155844156) internal successors, (943), 616 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 943 transitions. [2022-07-11 23:48:19,487 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 943 transitions. Word has length 89 [2022-07-11 23:48:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:19,487 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 943 transitions. [2022-07-11 23:48:19,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 943 transitions. [2022-07-11 23:48:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-11 23:48:19,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:19,489 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:19,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:48:19,489 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1165506567, now seen corresponding path program 1 times [2022-07-11 23:48:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:19,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183769965] [2022-07-11 23:48:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:19,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183769965] [2022-07-11 23:48:19,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183769965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:19,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:19,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476630788] [2022-07-11 23:48:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:19,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:19,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:19,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:19,632 INFO L87 Difference]: Start difference. First operand 617 states and 943 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-11 23:48:21,643 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-11 23:48:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:21,924 INFO L93 Difference]: Finished difference Result 1416 states and 2134 transitions. [2022-07-11 23:48:21,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:21,924 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 90 [2022-07-11 23:48:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:21,927 INFO L225 Difference]: With dead ends: 1416 [2022-07-11 23:48:21,927 INFO L226 Difference]: Without dead ends: 809 [2022-07-11 23:48:21,928 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-11 23:48:21,928 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 292 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.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:21,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 292 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:48:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-11 23:48:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 617. [2022-07-11 23:48:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.5097402597402598) internal successors, (930), 616 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 930 transitions. [2022-07-11 23:48:21,941 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 930 transitions. Word has length 90 [2022-07-11 23:48:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:21,941 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 930 transitions. [2022-07-11 23:48:21,941 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-11 23:48:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 930 transitions. [2022-07-11 23:48:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-11 23:48:21,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:21,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:21,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:48:21,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1304764074, now seen corresponding path program 1 times [2022-07-11 23:48:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:21,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366576063] [2022-07-11 23:48:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:22,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:22,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366576063] [2022-07-11 23:48:22,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366576063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:22,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:22,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:22,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356930772] [2022-07-11 23:48:22,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:22,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:22,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:22,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:22,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:22,112 INFO L87 Difference]: Start difference. First operand 617 states and 930 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-11 23:48:24,121 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-11 23:48:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:24,381 INFO L93 Difference]: Finished difference Result 1226 states and 1832 transitions. [2022-07-11 23:48:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:24,382 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 90 [2022-07-11 23:48:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:24,384 INFO L225 Difference]: With dead ends: 1226 [2022-07-11 23:48:24,384 INFO L226 Difference]: Without dead ends: 834 [2022-07-11 23:48:24,385 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-11 23:48:24,385 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 109 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:24,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-11 23:48:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 620. [2022-07-11 23:48:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.495961227786753) internal successors, (926), 619 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 926 transitions. [2022-07-11 23:48:24,397 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 926 transitions. Word has length 90 [2022-07-11 23:48:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:24,397 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 926 transitions. [2022-07-11 23:48:24,397 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-11 23:48:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 926 transitions. [2022-07-11 23:48:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-11 23:48:24,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:24,398 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:24,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:48:24,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash -823645421, now seen corresponding path program 1 times [2022-07-11 23:48:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:24,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337194541] [2022-07-11 23:48:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:24,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:24,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337194541] [2022-07-11 23:48:24,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337194541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:24,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:24,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793357176] [2022-07-11 23:48:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:24,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:24,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:24,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:24,554 INFO L87 Difference]: Start difference. First operand 620 states and 926 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-11 23:48:26,561 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-11 23:48:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:26,799 INFO L93 Difference]: Finished difference Result 1422 states and 2100 transitions. [2022-07-11 23:48:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:26,799 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 91 [2022-07-11 23:48:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:26,801 INFO L225 Difference]: With dead ends: 1422 [2022-07-11 23:48:26,802 INFO L226 Difference]: Without dead ends: 812 [2022-07-11 23:48:26,802 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-11 23:48:26,803 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 270 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-11 23:48:26,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-11 23:48:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-07-11 23:48:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4749596122778674) internal successors, (913), 619 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 913 transitions. [2022-07-11 23:48:26,815 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 913 transitions. Word has length 91 [2022-07-11 23:48:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:26,815 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 913 transitions. [2022-07-11 23:48:26,815 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-11 23:48:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 913 transitions. [2022-07-11 23:48:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-11 23:48:26,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:26,817 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:26,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:48:26,817 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -391297652, now seen corresponding path program 1 times [2022-07-11 23:48:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:26,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666304919] [2022-07-11 23:48:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666304919] [2022-07-11 23:48:26,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666304919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:26,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:26,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636942748] [2022-07-11 23:48:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:26,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:26,938 INFO L87 Difference]: Start difference. First operand 620 states and 913 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-11 23:48:28,945 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-11 23:48:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:29,213 INFO L93 Difference]: Finished difference Result 1422 states and 2074 transitions. [2022-07-11 23:48:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:29,214 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-11 23:48:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:29,216 INFO L225 Difference]: With dead ends: 1422 [2022-07-11 23:48:29,216 INFO L226 Difference]: Without dead ends: 812 [2022-07-11 23:48:29,217 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-11 23:48:29,217 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 113 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 272 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-11 23:48:29,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-11 23:48:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-07-11 23:48:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4539579967689822) internal successors, (900), 619 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 900 transitions. [2022-07-11 23:48:29,231 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 900 transitions. Word has length 92 [2022-07-11 23:48:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:29,231 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 900 transitions. [2022-07-11 23:48:29,231 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-11 23:48:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 900 transitions. [2022-07-11 23:48:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-11 23:48:29,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:29,233 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:29,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:48:29,233 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1939969181, now seen corresponding path program 1 times [2022-07-11 23:48:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:29,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859939731] [2022-07-11 23:48:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:48:29,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:29,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859939731] [2022-07-11 23:48:29,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859939731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:29,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:29,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278515038] [2022-07-11 23:48:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:29,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:29,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:29,408 INFO L87 Difference]: Start difference. First operand 620 states and 900 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-11 23:48:31,425 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-11 23:48:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:31,683 INFO L93 Difference]: Finished difference Result 1422 states and 2048 transitions. [2022-07-11 23:48:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:31,684 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-11 23:48:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:31,686 INFO L225 Difference]: With dead ends: 1422 [2022-07-11 23:48:31,686 INFO L226 Difference]: Without dead ends: 812 [2022-07-11 23:48:31,687 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-11 23:48:31,687 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 107 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 274 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-11 23:48:31,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 274 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-11 23:48:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-07-11 23:48:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4410339256865912) internal successors, (892), 619 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 892 transitions. [2022-07-11 23:48:31,699 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 892 transitions. Word has length 92 [2022-07-11 23:48:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:31,699 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 892 transitions. [2022-07-11 23:48:31,700 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-11 23:48:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 892 transitions. [2022-07-11 23:48:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-11 23:48:31,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:31,701 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:31,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:48:31,701 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:31,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash -109418661, now seen corresponding path program 1 times [2022-07-11 23:48:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:31,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989493917] [2022-07-11 23:48:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:31,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-11 23:48:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:31,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989493917] [2022-07-11 23:48:31,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989493917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:31,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:31,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:31,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284885650] [2022-07-11 23:48:31,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:31,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:31,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:31,825 INFO L87 Difference]: Start difference. First operand 620 states and 892 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:33,831 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-11 23:48:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:33,874 INFO L93 Difference]: Finished difference Result 1231 states and 1778 transitions. [2022-07-11 23:48:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-11 23:48:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:33,891 INFO L225 Difference]: With dead ends: 1231 [2022-07-11 23:48:33,891 INFO L226 Difference]: Without dead ends: 839 [2022-07-11 23:48:33,891 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-11 23:48:33,892 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 122 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 474 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-11 23:48:33,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:48:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-11 23:48:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2022-07-11 23:48:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.437947494033413) internal successors, (1205), 838 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1205 transitions. [2022-07-11 23:48:33,905 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1205 transitions. Word has length 92 [2022-07-11 23:48:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:33,906 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1205 transitions. [2022-07-11 23:48:33,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1205 transitions. [2022-07-11 23:48:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-11 23:48:33,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:33,907 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:33,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:48:33,907 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash 883897329, now seen corresponding path program 1 times [2022-07-11 23:48:33,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:33,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845380409] [2022-07-11 23:48:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:48:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845380409] [2022-07-11 23:48:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845380409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:34,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262373765] [2022-07-11 23:48:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:34,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:34,042 INFO L87 Difference]: Start difference. First operand 839 states and 1205 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:36,060 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-11 23:48:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:36,113 INFO L93 Difference]: Finished difference Result 1644 states and 2368 transitions. [2022-07-11 23:48:36,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:36,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-11 23:48:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:36,116 INFO L225 Difference]: With dead ends: 1644 [2022-07-11 23:48:36,116 INFO L226 Difference]: Without dead ends: 1033 [2022-07-11 23:48:36,117 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-11 23:48:36,117 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 473 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-11 23:48:36,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:48:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-07-11 23:48:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2022-07-11 23:48:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 1.436046511627907) internal successors, (1482), 1032 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1482 transitions. [2022-07-11 23:48:36,176 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1482 transitions. Word has length 94 [2022-07-11 23:48:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:36,176 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1482 transitions. [2022-07-11 23:48:36,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1482 transitions. [2022-07-11 23:48:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-11 23:48:36,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:36,185 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, 1] [2022-07-11 23:48:36,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:48:36,185 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:36,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2022-07-11 23:48:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:36,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440688285] [2022-07-11 23:48:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:48:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:36,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440688285] [2022-07-11 23:48:36,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440688285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:36,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:36,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910524845] [2022-07-11 23:48:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:36,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:36,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:36,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:36,425 INFO L87 Difference]: Start difference. First operand 1033 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:38,437 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-11 23:48:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:38,476 INFO L93 Difference]: Finished difference Result 1835 states and 2635 transitions. [2022-07-11 23:48:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-07-11 23:48:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:38,479 INFO L225 Difference]: With dead ends: 1835 [2022-07-11 23:48:38,479 INFO L226 Difference]: Without dead ends: 1030 [2022-07-11 23:48:38,480 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-11 23:48:38,480 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:38,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:48:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-07-11 23:48:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2022-07-11 23:48:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4305150631681245) internal successors, (1472), 1029 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1472 transitions. [2022-07-11 23:48:38,498 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1472 transitions. Word has length 113 [2022-07-11 23:48:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:38,498 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1472 transitions. [2022-07-11 23:48:38,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1472 transitions. [2022-07-11 23:48:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-11 23:48:38,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:38,500 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, 1, 1, 1] [2022-07-11 23:48:38,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:48:38,501 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2022-07-11 23:48:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:38,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391031975] [2022-07-11 23:48:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:48:38,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:38,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391031975] [2022-07-11 23:48:38,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391031975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:38,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:38,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023789423] [2022-07-11 23:48:38,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:38,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:38,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:38,647 INFO L87 Difference]: Start difference. First operand 1030 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:40,655 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-11 23:48:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:40,926 INFO L93 Difference]: Finished difference Result 2478 states and 3517 transitions. [2022-07-11 23:48:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 115 [2022-07-11 23:48:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:40,931 INFO L225 Difference]: With dead ends: 2478 [2022-07-11 23:48:40,931 INFO L226 Difference]: Without dead ends: 1458 [2022-07-11 23:48:40,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:40,934 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 94 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:40,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 275 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 204 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-07-11 23:48:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1056. [2022-07-11 23:48:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1055 states have (on average 1.4293838862559243) internal successors, (1508), 1055 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1508 transitions. [2022-07-11 23:48:40,959 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1508 transitions. Word has length 115 [2022-07-11 23:48:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:40,959 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1508 transitions. [2022-07-11 23:48:40,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1508 transitions. [2022-07-11 23:48:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-11 23:48:40,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:40,962 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-07-11 23:48:40,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:48:40,962 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-11 23:48:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:40,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637162297] [2022-07-11 23:48:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:48:41,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:48:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:48:42,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 23:48:42,164 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:48:42,165 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:48:42,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:48:42,171 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] [2022-07-11 23:48:42,173 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:48:42,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:48:42 BoogieIcfgContainer [2022-07-11 23:48:42,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:48:42,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:48:42,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:48:42,303 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:48:42,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:44" (3/4) ... [2022-07-11 23:48:42,305 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-11 23:48:42,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:48:42,306 INFO L158 Benchmark]: Toolchain (without parser) took 61439.33ms. Allocated memory was 100.7MB in the beginning and 220.2MB in the end (delta: 119.5MB). Free memory was 60.0MB in the beginning and 85.4MB in the end (delta: -25.4MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. [2022-07-11 23:48:42,306 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:48:42,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.35ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 57.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-07-11 23:48:42,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.50ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 52.2MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:48:42,307 INFO L158 Benchmark]: Boogie Preprocessor took 52.41ms. Allocated memory is still 100.7MB. Free memory was 52.2MB in the beginning and 45.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:48:42,307 INFO L158 Benchmark]: RCFGBuilder took 2737.08ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 45.5MB in the beginning and 70.1MB in the end (delta: -24.5MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-07-11 23:48:42,307 INFO L158 Benchmark]: TraceAbstraction took 58084.60ms. Allocated memory was 121.6MB in the beginning and 220.2MB in the end (delta: 98.6MB). Free memory was 70.1MB in the beginning and 86.4MB in the end (delta: -16.4MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2022-07-11 23:48:42,307 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 220.2MB. Free memory was 86.4MB in the beginning and 85.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:48:42,308 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.10ms. Allocated memory is still 100.7MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.35ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 57.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.50ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 52.2MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.41ms. Allocated memory is still 100.7MB. Free memory was 52.2MB in the beginning and 45.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2737.08ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 45.5MB in the beginning and 70.1MB in the end (delta: -24.5MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58084.60ms. Allocated memory was 121.6MB in the beginning and 220.2MB in the end (delta: 98.6MB). Free memory was 70.1MB in the beginning and 86.4MB in the end (delta: -16.4MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 220.2MB. Free memory was 86.4MB in the beginning and 85.4MB 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: 1668]: 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 1353. 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:1}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0] [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1272] EXPR s->version VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=8, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0] [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) [L1344] s->hit VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1349] s->init_num = 0 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:1}, ((s->s3)->tmp.new_cipher)->algorithms=4294967322, (s->s3)->tmp.new_cipher={-9:0}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] COND FALSE !(ret <= 0) VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1368] s->state = 4416 [L1369] s->init_num = 0 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=-14, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1668] reach_error() VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=-14, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.9s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 52.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 2208 SdHoareTripleChecker+Valid, 52.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2208 mSDsluCounter, 8058 SdHoareTripleChecker+Invalid, 51.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4363 mSDsCounter, 527 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3312 IncrementalHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 527 mSolverCounterUnsat, 3695 mSDtfsCounter, 3312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1056occurred in iteration=21, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 2614 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1757 NumberOfCodeBlocks, 1757 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 3791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 1350/1350 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-11 23:48:42,347 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.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:48:43,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:48:43,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:48:43,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:48:43,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:48:43,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:48:43,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:48:43,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:48:43,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:48:43,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:48:43,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:48:43,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:48:43,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:48:43,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:48:43,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:48:43,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:48:43,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:48:43,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:48:43,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:48:43,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:48:43,995 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:48:43,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:48:43,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:48:43,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:48:43,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:48:44,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:48:44,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:48:44,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:48:44,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:48:44,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:48:44,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:48:44,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:48:44,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:48:44,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:48:44,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:48:44,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:48:44,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:48:44,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:48:44,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:48:44,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:48:44,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:48:44,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:48:44,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:48:44,040 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:48:44,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:48:44,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:48:44,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:48:44,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:48:44,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:48:44,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:48:44,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:48:44,042 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:48:44,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:48:44,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:48:44,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:48:44,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:48:44,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:48:44,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:48:44,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:48:44,051 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:48:44,051 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:48:44,051 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:48:44,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:48:44,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:48:44,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:48:44,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:48:44,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:48:44,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:48:44,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:48:44,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:48:44,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:48:44,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:48:44,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:48:44,054 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:48:44,054 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:48:44,054 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:48:44,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:48:44,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:48:44,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:48:44,055 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 -> 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 [2022-07-11 23:48:44,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:48:44,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:48:44,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:48:44,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:48:44,365 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:48:44,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-11 23:48:44,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4fbcd6e/c3f5bd75058640f9b468e2fcb0ba6a73/FLAGb17c22e4b [2022-07-11 23:48:44,863 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:48:44,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-11 23:48:44,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4fbcd6e/c3f5bd75058640f9b468e2fcb0ba6a73/FLAGb17c22e4b [2022-07-11 23:48:45,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4fbcd6e/c3f5bd75058640f9b468e2fcb0ba6a73 [2022-07-11 23:48:45,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:48:45,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:48:45,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:48:45,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:48:45,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:48:45,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb4cd10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45, skipping insertion in model container [2022-07-11 23:48:45,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:48:45,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:48:45,583 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.01.i.cil-2.c[65520,65533] [2022-07-11 23:48:45,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:48:45,614 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-11 23:48:45,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:48:45,709 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.01.i.cil-2.c[65520,65533] [2022-07-11 23:48:45,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:48:45,723 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:48:45,791 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.01.i.cil-2.c[65520,65533] [2022-07-11 23:48:45,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:48:45,813 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:48:45,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45 WrapperNode [2022-07-11 23:48:45,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:48:45,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:48:45,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:48:45,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:48:45,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,908 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 694 [2022-07-11 23:48:45,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:48:45,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:48:45,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:48:45,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:48:45,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:48:45,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:48:45,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:48:45,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:48:45,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (1/1) ... [2022-07-11 23:48:45,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:48:45,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:48:46,006 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-11 23:48:46,011 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-11 23:48:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:48:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:48:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:48:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-11 23:48:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:48:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:48:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:48:46,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:48:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-11 23:48:46,154 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:48:46,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:48:46,165 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:48:52,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-11 23:48:52,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-11 23:48:52,139 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:48:52,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:48:52,145 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:48:52,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:48:52 BoogieIcfgContainer [2022-07-11 23:48:52,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:48:52,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:48:52,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:48:52,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:48:52,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:48:45" (1/3) ... [2022-07-11 23:48:52,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52933b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:48:52, skipping insertion in model container [2022-07-11 23:48:52,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:48:45" (2/3) ... [2022-07-11 23:48:52,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52933b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:48:52, skipping insertion in model container [2022-07-11 23:48:52,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:48:52" (3/3) ... [2022-07-11 23:48:52,151 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-07-11 23:48:52,160 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:48:52,160 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:48:52,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:48:52,210 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@2ddadd05, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3035bf7d [2022-07-11 23:48:52,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:48:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:48:52,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:52,219 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-11 23:48:52,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-11 23:48:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:48:52,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870494205] [2022-07-11 23:48:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:48:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:48:52,238 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-11 23:48:52,245 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-11 23:48:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:52,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:48:52,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:48:53,049 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-11 23:48:53,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:48:53,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:48:53,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870494205] [2022-07-11 23:48:53,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870494205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:53,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:53,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661693443] [2022-07-11 23:48:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:53,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:48:53,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:53,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:53,076 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 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-11 23:48:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:53,193 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-11 23:48:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:53,195 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-11 23:48:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:53,205 INFO L225 Difference]: With dead ends: 375 [2022-07-11 23:48:53,205 INFO L226 Difference]: Without dead ends: 217 [2022-07-11 23:48:53,208 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-11 23:48:53,211 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 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-11 23:48:53,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:48:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-11 23:48:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-11 23:48:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-11 23:48:53,266 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-11 23:48:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:53,266 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-11 23:48:53,266 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-11 23:48:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-11 23:48:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:48:53,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:53,268 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-11 23:48:53,288 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-11 23:48:53,487 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-11 23:48:53,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-11 23:48:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:48:53,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241182738] [2022-07-11 23:48:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:48:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:48:53,490 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-11 23:48:53,492 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-11 23:48:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:54,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:48:54,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:48:54,282 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-11 23:48:54,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:48:54,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:48:54,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241182738] [2022-07-11 23:48:54,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241182738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:54,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:54,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:54,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140517821] [2022-07-11 23:48:54,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:54,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:48:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:54,284 INFO L87 Difference]: Start difference. First operand 217 states and 321 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-11 23:48:56,303 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-11 23:48:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:56,385 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-07-11 23:48:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:56,385 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-11 23:48:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:56,387 INFO L225 Difference]: With dead ends: 426 [2022-07-11 23:48:56,387 INFO L226 Difference]: Without dead ends: 319 [2022-07-11 23:48:56,387 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-11 23:48:56,388 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 126 mSDsluCounter, 158 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-11 23:48:56,388 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-11 23:48:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-11 23:48:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-07-11 23:48:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4779874213836477) internal successors, (470), 318 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-07-11 23:48:56,399 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-07-11 23:48:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:56,399 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-07-11 23:48:56,400 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-11 23:48:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-07-11 23:48:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:48:56,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:56,402 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-11 23:48:56,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-11 23:48:56,615 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-11 23:48:56,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-07-11 23:48:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:48:56,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400657078] [2022-07-11 23:48:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:48:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:48:56,619 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-11 23:48:56,620 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-11 23:48:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:57,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:48:57,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:48:57,399 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-11 23:48:57,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:48:57,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:48:57,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400657078] [2022-07-11 23:48:57,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400657078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:57,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:57,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:57,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229946749] [2022-07-11 23:48:57,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:57,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:48:57,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:57,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:57,401 INFO L87 Difference]: Start difference. First operand 319 states and 470 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-11 23:48:59,417 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-11 23:48:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:59,488 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-07-11 23:48:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:59,489 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-11 23:48:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:59,490 INFO L225 Difference]: With dead ends: 632 [2022-07-11 23:48:59,490 INFO L226 Difference]: Without dead ends: 423 [2022-07-11 23:48:59,491 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-11 23:48:59,492 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 474 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-11 23:48:59,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:48:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-11 23:48:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-07-11 23:48:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-07-11 23:48:59,506 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-07-11 23:48:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:59,507 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-07-11 23:48:59,507 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-11 23:48:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-07-11 23:48:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:48:59,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:59,514 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-11 23:48:59,537 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-11 23:48:59,714 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-11 23:48:59,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-07-11 23:48:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:48:59,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371078345] [2022-07-11 23:48:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:59,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:48:59,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:48:59,718 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-11 23:48:59,719 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-11 23:49:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:00,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:49:00,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:49:00,590 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-11 23:49:00,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:49:00,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:49:00,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371078345] [2022-07-11 23:49:00,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371078345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:00,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:00,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:49:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832847737] [2022-07-11 23:49:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:00,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:49:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:49:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:49:00,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:49:00,592 INFO L87 Difference]: Start difference. First operand 423 states and 622 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-11 23:49:02,608 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-11 23:49:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:02,674 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-07-11 23:49:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:49:02,675 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-11 23:49:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:02,677 INFO L225 Difference]: With dead ends: 839 [2022-07-11 23:49:02,677 INFO L226 Difference]: Without dead ends: 526 [2022-07-11 23:49:02,677 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-11 23:49:02,679 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 473 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-11 23:49:02,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:49:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-11 23:49:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-07-11 23:49:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4723809523809523) internal successors, (773), 525 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-07-11 23:49:02,688 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-07-11 23:49:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:02,689 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-07-11 23:49:02,691 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-11 23:49:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-07-11 23:49:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-11 23:49:02,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:02,695 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-11 23:49:02,715 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-11 23:49:02,900 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-11 23:49:02,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-07-11 23:49:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:49:02,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101617498] [2022-07-11 23:49:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:02,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:49:02,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:49:02,903 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-11 23:49:02,905 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-11 23:49:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:03,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:49:03,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:49:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-11 23:49:03,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:49:03,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:49:03,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101617498] [2022-07-11 23:49:03,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101617498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:03,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:03,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:49:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314885526] [2022-07-11 23:49:03,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:03,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:49:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:49:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:49:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:49:03,769 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:05,785 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-11 23:49:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:05,851 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-07-11 23:49:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:49:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-11 23:49:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:05,854 INFO L225 Difference]: With dead ends: 939 [2022-07-11 23:49:05,854 INFO L226 Difference]: Without dead ends: 523 [2022-07-11 23:49:05,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-11 23:49:05,855 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:05,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:49:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-11 23:49:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-11 23:49:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4616858237547892) internal successors, (763), 522 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-07-11 23:49:05,864 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-07-11 23:49:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:05,864 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-07-11 23:49:05,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:49:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-07-11 23:49:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-11 23:49:05,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:05,865 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, 1, 1] [2022-07-11 23:49:05,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:49:06,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:49:06,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-07-11 23:49:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:49:06,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905246388] [2022-07-11 23:49:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:06,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:49:06,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:49:06,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:49:06,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-11 23:49:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:07,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:49:07,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:49:09,196 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-11 23:49:09,197 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-11 23:49:22,110 WARN L233 SmtUtils]: Spent 12.83s 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-11 23:49:22,111 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-11 23:49:22,111 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 4114 treesize of output 4792 [2022-07-11 23:49:22,151 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 4387 treesize of output 3109 [2022-07-11 23:49:22,285 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 4561 treesize of output 4027 [2022-07-11 23:49:23,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:49:23,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3791 treesize of output 3115 [2022-07-11 23:49:24,036 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 1375 treesize of output 1263 [2022-07-11 23:49:24,712 INFO L244 Elim1Store]: Index analysis took 206 ms [2022-07-11 23:49:26,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:49:26,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1229 treesize of output 1053 [2022-07-11 23:49:27,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:27,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:28,082 INFO L244 Elim1Store]: Index analysis took 897 ms [2022-07-11 23:49:29,753 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-11 23:49:30,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:30,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:31,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:31,630 INFO L244 Elim1Store]: Index analysis took 1474 ms [2022-07-11 23:49:32,804 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-11 23:49:33,219 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 137 treesize of output 113 [2022-07-11 23:49:33,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:33,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:49:34,763 INFO L244 Elim1Store]: Index analysis took 1198 ms [2022-07-11 23:49:35,487 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