./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:58:17,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:58:17,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:58:17,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:58:17,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:58:17,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:58:17,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:58:17,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:58:17,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:58:17,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:58:17,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:58:17,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:58:17,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:58:17,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:58:17,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:58:17,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:58:17,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:58:17,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:58:17,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:58:17,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:58:17,794 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:58:17,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:58:17,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:58:17,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:58:17,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:58:17,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:58:17,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:58:17,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:58:17,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:58:17,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:58:17,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:58:17,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:58:17,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:58:17,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:58:17,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:58:17,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:58:17,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:58:17,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:58:17,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:58:17,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:58:17,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:58:17,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:58:17,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:58:17,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:58:17,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:58:17,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:58:17,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:58:17,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:58:17,848 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:58:17,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:58:17,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:58:17,849 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:58:17,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:58:17,850 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:58:17,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:58:17,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:58:17,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:58:17,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:58:17,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:58:17,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:58:17,851 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:58:17,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:58:17,852 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:58:17,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:58:17,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:58:17,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:58:17,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:58:17,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:58:17,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:58:17,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:58:17,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:58:17,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:58:17,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:58:17,854 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:58:17,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:58:17,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:58:17,855 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 -> cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 [2022-07-19 10:58:18,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:58:18,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:58:18,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:58:18,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:58:18,098 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:58:18,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-19 10:58:18,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3e9aed0/8c73a4aad47f48978d6c6529867d9a99/FLAGedd8b0b78 [2022-07-19 10:58:18,661 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:58:18,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-19 10:58:18,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3e9aed0/8c73a4aad47f48978d6c6529867d9a99/FLAGedd8b0b78 [2022-07-19 10:58:18,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3e9aed0/8c73a4aad47f48978d6c6529867d9a99 [2022-07-19 10:58:18,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:58:18,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:58:18,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:58:18,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:58:18,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:58:18,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:58:18" (1/1) ... [2022-07-19 10:58:18,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6991d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:18, skipping insertion in model container [2022-07-19 10:58:18,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:58:18" (1/1) ... [2022-07-19 10:58:18,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:58:19,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:58:19,398 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.02.i.cil-1.c[65397,65410] [2022-07-19 10:58:19,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:58:19,433 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:58:19,495 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.02.i.cil-1.c[65397,65410] [2022-07-19 10:58:19,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:58:19,512 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:58:19,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19 WrapperNode [2022-07-19 10:58:19,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:58:19,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:58:19,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:58:19,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:58:19,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,612 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-07-19 10:58:19,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:58:19,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:58:19,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:58:19,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:58:19,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:58:19,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:58:19,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:58:19,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:58:19,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (1/1) ... [2022-07-19 10:58:19,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:58:19,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:58:19,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:58:19,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:58:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:58:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 10:58:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:58:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:58:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 10:58:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:58:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:58:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:58:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:58:19,976 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:58:19,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:58:19,990 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:23,091 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-19 10:58:23,091 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-19 10:58:23,092 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:58:23,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:58:23,101 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:58:23,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:58:23 BoogieIcfgContainer [2022-07-19 10:58:23,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:58:23,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:58:23,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:58:23,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:58:23,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:58:18" (1/3) ... [2022-07-19 10:58:23,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2c1ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:58:23, skipping insertion in model container [2022-07-19 10:58:23,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:58:19" (2/3) ... [2022-07-19 10:58:23,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2c1ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:58:23, skipping insertion in model container [2022-07-19 10:58:23,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:58:23" (3/3) ... [2022-07-19 10:58:23,112 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-07-19 10:58:23,123 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:58:23,123 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:58:23,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:58:23,184 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@311992c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73039c95 [2022-07-19 10:58:23,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:58:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:58:23,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:23,205 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-19 10:58:23,205 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-19 10:58:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:23,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395879347] [2022-07-19 10:58:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:58:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:23,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395879347] [2022-07-19 10:58:23,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395879347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:23,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:23,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508588615] [2022-07-19 10:58:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:23,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:23,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:23,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:23,920 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:25,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:26,187 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-07-19 10:58:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:26,190 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-19 10:58:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:26,198 INFO L225 Difference]: With dead ends: 255 [2022-07-19 10:58:26,198 INFO L226 Difference]: Without dead ends: 116 [2022-07-19 10:58:26,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:26,203 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:26,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 10:58:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-19 10:58:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-19 10:58:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-19 10:58:26,241 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-19 10:58:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:26,242 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-19 10:58:26,242 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-19 10:58:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-19 10:58:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 10:58:26,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:26,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:26,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:58:26,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-07-19 10:58:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:26,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242887060] [2022-07-19 10:58:26,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:26,474 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-19 10:58:26,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:26,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242887060] [2022-07-19 10:58:26,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242887060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:26,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:26,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:58:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486992422] [2022-07-19 10:58:26,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:26,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:58:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:26,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:58:26,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:58:26,479 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:26,511 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2022-07-19 10:58:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:58:26,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-19 10:58:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:26,514 INFO L225 Difference]: With dead ends: 320 [2022-07-19 10:58:26,514 INFO L226 Difference]: Without dead ends: 215 [2022-07-19 10:58:26,515 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-19 10:58:26,516 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 123 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:26,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 311 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:58:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-19 10:58:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-07-19 10:58:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 214 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2022-07-19 10:58:26,534 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2022-07-19 10:58:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:26,534 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2022-07-19 10:58:26,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2022-07-19 10:58:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:58:26,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:26,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:26,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:58:26,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2022-07-19 10:58:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:26,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833698815] [2022-07-19 10:58:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:26,770 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-19 10:58:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:26,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833698815] [2022-07-19 10:58:26,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833698815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:26,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:26,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:58:26,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808504181] [2022-07-19 10:58:26,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:26,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:58:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:26,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:58:26,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:58:26,773 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:28,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:28,853 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2022-07-19 10:58:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:58:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-19 10:58:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:28,857 INFO L225 Difference]: With dead ends: 420 [2022-07-19 10:58:28,857 INFO L226 Difference]: Without dead ends: 315 [2022-07-19 10:58:28,858 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-19 10:58:28,859 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 460 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-19 10:58:28,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 460 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 10:58:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-19 10:58:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-07-19 10:58:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.484076433121019) internal successors, (466), 314 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2022-07-19 10:58:28,882 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2022-07-19 10:58:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:28,882 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2022-07-19 10:58:28,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2022-07-19 10:58:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 10:58:28,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:28,886 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:28,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:58:28,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2022-07-19 10:58:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:28,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670802469] [2022-07-19 10:58:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:29,175 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-19 10:58:29,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:29,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670802469] [2022-07-19 10:58:29,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670802469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:29,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:29,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447470982] [2022-07-19 10:58:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:29,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:29,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:29,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:29,183 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:31,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:31,521 INFO L93 Difference]: Finished difference Result 891 states and 1325 transitions. [2022-07-19 10:58:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:31,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-19 10:58:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:31,525 INFO L225 Difference]: With dead ends: 891 [2022-07-19 10:58:31,525 INFO L226 Difference]: Without dead ends: 586 [2022-07-19 10:58:31,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:31,528 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:31,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:58:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-07-19 10:58:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2022-07-19 10:58:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.5336787564766838) internal successors, (592), 386 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2022-07-19 10:58:31,549 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 71 [2022-07-19 10:58:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:31,550 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2022-07-19 10:58:31,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2022-07-19 10:58:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:58:31,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:31,554 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:31,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:58:31,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2022-07-19 10:58:31,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:31,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319381662] [2022-07-19 10:58:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:31,797 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-19 10:58:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:31,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319381662] [2022-07-19 10:58:31,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319381662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:31,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:31,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171180011] [2022-07-19 10:58:31,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:31,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:31,802 INFO L87 Difference]: Start difference. First operand 387 states and 592 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:33,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:35,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:36,176 INFO L93 Difference]: Finished difference Result 941 states and 1438 transitions. [2022-07-19 10:58:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-19 10:58:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:36,180 INFO L225 Difference]: With dead ends: 941 [2022-07-19 10:58:36,180 INFO L226 Difference]: Without dead ends: 564 [2022-07-19 10:58:36,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:36,182 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 91 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:36,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 10:58:36,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-07-19 10:58:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 439. [2022-07-19 10:58:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.552511415525114) internal successors, (680), 438 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 680 transitions. [2022-07-19 10:58:36,198 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 680 transitions. Word has length 72 [2022-07-19 10:58:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:36,198 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 680 transitions. [2022-07-19 10:58:36,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 680 transitions. [2022-07-19 10:58:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:58:36,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:36,202 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:36,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:58:36,203 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 26233355, now seen corresponding path program 1 times [2022-07-19 10:58:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:36,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465005810] [2022-07-19 10:58:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:36,429 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-19 10:58:36,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:36,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465005810] [2022-07-19 10:58:36,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465005810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:36,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:36,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193548581] [2022-07-19 10:58:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:36,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:36,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:36,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:36,435 INFO L87 Difference]: Start difference. First operand 439 states and 680 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:38,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:38,765 INFO L93 Difference]: Finished difference Result 1139 states and 1753 transitions. [2022-07-19 10:58:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:38,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-19 10:58:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:38,769 INFO L225 Difference]: With dead ends: 1139 [2022-07-19 10:58:38,770 INFO L226 Difference]: Without dead ends: 710 [2022-07-19 10:58:38,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:38,773 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:38,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:58:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-19 10:58:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 462. [2022-07-19 10:58:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.5704989154013016) internal successors, (724), 461 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 724 transitions. [2022-07-19 10:58:38,793 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 724 transitions. Word has length 72 [2022-07-19 10:58:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:38,794 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 724 transitions. [2022-07-19 10:58:38,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 724 transitions. [2022-07-19 10:58:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 10:58:38,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:38,799 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:38,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:58:38,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1848863885, now seen corresponding path program 1 times [2022-07-19 10:58:38,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:38,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290144862] [2022-07-19 10:58:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:58:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290144862] [2022-07-19 10:58:39,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290144862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:39,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:39,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17452673] [2022-07-19 10:58:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:39,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:39,008 INFO L87 Difference]: Start difference. First operand 462 states and 724 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:41,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:43,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:43,395 INFO L93 Difference]: Finished difference Result 1091 states and 1700 transitions. [2022-07-19 10:58:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:43,395 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-19 10:58:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:43,398 INFO L225 Difference]: With dead ends: 1091 [2022-07-19 10:58:43,398 INFO L226 Difference]: Without dead ends: 639 [2022-07-19 10:58:43,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:43,399 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:43,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 10:58:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-07-19 10:58:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 508. [2022-07-19 10:58:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.581854043392505) internal successors, (802), 507 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 802 transitions. [2022-07-19 10:58:43,411 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 802 transitions. Word has length 92 [2022-07-19 10:58:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:43,412 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 802 transitions. [2022-07-19 10:58:43,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 802 transitions. [2022-07-19 10:58:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 10:58:43,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:43,414 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:43,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:58:43,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1552617073, now seen corresponding path program 1 times [2022-07-19 10:58:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:43,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208519810] [2022-07-19 10:58:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:58:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:43,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208519810] [2022-07-19 10:58:43,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208519810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:43,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:43,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694475958] [2022-07-19 10:58:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:43,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:43,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:43,628 INFO L87 Difference]: Start difference. First operand 508 states and 802 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-19 10:58:45,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:47,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:47,890 INFO L93 Difference]: Finished difference Result 1091 states and 1717 transitions. [2022-07-19 10:58:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:47,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-19 10:58:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:47,894 INFO L225 Difference]: With dead ends: 1091 [2022-07-19 10:58:47,894 INFO L226 Difference]: Without dead ends: 593 [2022-07-19 10:58:47,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:47,896 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:47,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 494 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:58:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-19 10:58:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 548. [2022-07-19 10:58:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5904936014625228) internal successors, (870), 547 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 870 transitions. [2022-07-19 10:58:47,910 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 870 transitions. Word has length 92 [2022-07-19 10:58:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:47,910 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 870 transitions. [2022-07-19 10:58:47,911 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-19 10:58:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 870 transitions. [2022-07-19 10:58:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 10:58:47,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:47,912 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:47,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:58:47,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:47,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1859686006, now seen corresponding path program 1 times [2022-07-19 10:58:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:47,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163435545] [2022-07-19 10:58:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:47,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:58:48,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:48,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163435545] [2022-07-19 10:58:48,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163435545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:48,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:48,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061020458] [2022-07-19 10:58:48,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:48,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:48,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:48,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:48,122 INFO L87 Difference]: Start difference. First operand 548 states and 870 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:50,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:50,450 INFO L93 Difference]: Finished difference Result 1282 states and 1998 transitions. [2022-07-19 10:58:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:50,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-19 10:58:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:50,454 INFO L225 Difference]: With dead ends: 1282 [2022-07-19 10:58:50,454 INFO L226 Difference]: Without dead ends: 744 [2022-07-19 10:58:50,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:50,457 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:50,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:58:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-19 10:58:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 548. [2022-07-19 10:58:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5795246800731262) internal successors, (864), 547 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 864 transitions. [2022-07-19 10:58:50,477 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 864 transitions. Word has length 93 [2022-07-19 10:58:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:50,478 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 864 transitions. [2022-07-19 10:58:50,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 864 transitions. [2022-07-19 10:58:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 10:58:50,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:50,480 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:50,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:58:50,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash 500641909, now seen corresponding path program 2 times [2022-07-19 10:58:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:50,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259662746] [2022-07-19 10:58:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:50,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:58:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259662746] [2022-07-19 10:58:50,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259662746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:50,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:50,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705668934] [2022-07-19 10:58:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:50,738 INFO L87 Difference]: Start difference. First operand 548 states and 864 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-19 10:58:52,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:54,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:55,072 INFO L93 Difference]: Finished difference Result 1279 states and 1983 transitions. [2022-07-19 10:58:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 10:58:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:55,075 INFO L225 Difference]: With dead ends: 1279 [2022-07-19 10:58:55,076 INFO L226 Difference]: Without dead ends: 741 [2022-07-19 10:58:55,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:55,077 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:55,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 10:58:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-19 10:58:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 548. [2022-07-19 10:58:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5612431444241317) internal successors, (854), 547 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 854 transitions. [2022-07-19 10:58:55,093 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 854 transitions. Word has length 106 [2022-07-19 10:58:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:55,094 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 854 transitions. [2022-07-19 10:58:55,094 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-19 10:58:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 854 transitions. [2022-07-19 10:58:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 10:58:55,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:55,096 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:55,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:58:55,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1117113491, now seen corresponding path program 1 times [2022-07-19 10:58:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:55,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599386236] [2022-07-19 10:58:55,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:58:55,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599386236] [2022-07-19 10:58:55,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599386236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:55,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:55,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18595406] [2022-07-19 10:58:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:55,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:55,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:55,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:55,293 INFO L87 Difference]: Start difference. First operand 548 states and 854 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-19 10:58:57,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:59,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:59,682 INFO L93 Difference]: Finished difference Result 1209 states and 1869 transitions. [2022-07-19 10:58:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:59,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 10:58:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:59,685 INFO L225 Difference]: With dead ends: 1209 [2022-07-19 10:58:59,685 INFO L226 Difference]: Without dead ends: 671 [2022-07-19 10:58:59,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:59,687 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 97 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:59,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 538 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 10:58:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-07-19 10:58:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 548. [2022-07-19 10:58:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5575868372943327) internal successors, (852), 547 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 852 transitions. [2022-07-19 10:58:59,702 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 852 transitions. Word has length 106 [2022-07-19 10:58:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:59,702 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 852 transitions. [2022-07-19 10:58:59,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:58:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 852 transitions. [2022-07-19 10:58:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 10:58:59,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:59,704 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:59,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:58:59,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:59,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1677813269, now seen corresponding path program 1 times [2022-07-19 10:58:59,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:59,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401588456] [2022-07-19 10:58:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:58:59,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:59,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401588456] [2022-07-19 10:58:59,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401588456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:59,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:59,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648941577] [2022-07-19 10:58:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:59,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:59,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:59,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:59,868 INFO L87 Difference]: Start difference. First operand 548 states and 852 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-19 10:59:01,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:03,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:04,126 INFO L93 Difference]: Finished difference Result 1129 states and 1745 transitions. [2022-07-19 10:59:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:04,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 10:59:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:04,129 INFO L225 Difference]: With dead ends: 1129 [2022-07-19 10:59:04,130 INFO L226 Difference]: Without dead ends: 591 [2022-07-19 10:59:04,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:04,131 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:04,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 492 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:59:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-19 10:59:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 548. [2022-07-19 10:59:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5539305301645339) internal successors, (850), 547 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 850 transitions. [2022-07-19 10:59:04,146 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 850 transitions. Word has length 106 [2022-07-19 10:59:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:04,146 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 850 transitions. [2022-07-19 10:59:04,146 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-19 10:59:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 850 transitions. [2022-07-19 10:59:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 10:59:04,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:04,148 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:04,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:59:04,148 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash -602992740, now seen corresponding path program 1 times [2022-07-19 10:59:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:04,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474512242] [2022-07-19 10:59:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:04,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474512242] [2022-07-19 10:59:04,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474512242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:04,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:04,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820282205] [2022-07-19 10:59:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:04,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:04,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:04,337 INFO L87 Difference]: Start difference. First operand 548 states and 850 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-19 10:59:06,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:06,683 INFO L93 Difference]: Finished difference Result 1280 states and 1956 transitions. [2022-07-19 10:59:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-19 10:59:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:06,686 INFO L225 Difference]: With dead ends: 1280 [2022-07-19 10:59:06,686 INFO L226 Difference]: Without dead ends: 742 [2022-07-19 10:59:06,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-19 10:59:06,688 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 117 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 290 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-19 10:59:06,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 290 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:59:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-07-19 10:59:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 548. [2022-07-19 10:59:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5356489945155394) internal successors, (840), 547 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 840 transitions. [2022-07-19 10:59:06,706 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 840 transitions. Word has length 107 [2022-07-19 10:59:06,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:06,706 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 840 transitions. [2022-07-19 10:59:06,706 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-19 10:59:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 840 transitions. [2022-07-19 10:59:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 10:59:06,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:06,708 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:06,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:59:06,709 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1332849040, now seen corresponding path program 1 times [2022-07-19 10:59:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:06,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348718510] [2022-07-19 10:59:06,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:59:06,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:06,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348718510] [2022-07-19 10:59:06,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348718510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:06,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:06,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489121938] [2022-07-19 10:59:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:06,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:06,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:06,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:06,904 INFO L87 Difference]: Start difference. First operand 548 states and 840 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:08,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:09,259 INFO L93 Difference]: Finished difference Result 1361 states and 2062 transitions. [2022-07-19 10:59:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:09,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-19 10:59:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:09,263 INFO L225 Difference]: With dead ends: 1361 [2022-07-19 10:59:09,263 INFO L226 Difference]: Without dead ends: 823 [2022-07-19 10:59:09,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:09,264 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:09,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:59:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-07-19 10:59:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 662. [2022-07-19 10:59:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5567322239031771) internal successors, (1029), 661 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1029 transitions. [2022-07-19 10:59:09,285 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1029 transitions. Word has length 107 [2022-07-19 10:59:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:09,286 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1029 transitions. [2022-07-19 10:59:09,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1029 transitions. [2022-07-19 10:59:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 10:59:09,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:09,288 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:09,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:59:09,288 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:09,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1015692680, now seen corresponding path program 1 times [2022-07-19 10:59:09,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:09,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11609709] [2022-07-19 10:59:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:09,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11609709] [2022-07-19 10:59:09,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11609709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:09,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:09,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440725024] [2022-07-19 10:59:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:09,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:09,478 INFO L87 Difference]: Start difference. First operand 662 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:11,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:11,804 INFO L93 Difference]: Finished difference Result 1508 states and 2314 transitions. [2022-07-19 10:59:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:11,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 10:59:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:11,808 INFO L225 Difference]: With dead ends: 1508 [2022-07-19 10:59:11,808 INFO L226 Difference]: Without dead ends: 856 [2022-07-19 10:59:11,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:11,809 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 115 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:11,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:59:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-07-19 10:59:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 662. [2022-07-19 10:59:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5370650529500756) internal successors, (1016), 661 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1016 transitions. [2022-07-19 10:59:11,831 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1016 transitions. Word has length 108 [2022-07-19 10:59:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:11,832 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1016 transitions. [2022-07-19 10:59:11,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:11,832 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1016 transitions. [2022-07-19 10:59:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 10:59:11,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:11,834 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:11,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:59:11,834 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash -805941339, now seen corresponding path program 1 times [2022-07-19 10:59:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:11,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114430293] [2022-07-19 10:59:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:12,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:12,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114430293] [2022-07-19 10:59:12,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114430293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:12,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:12,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122369771] [2022-07-19 10:59:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:12,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:12,012 INFO L87 Difference]: Start difference. First operand 662 states and 1016 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:14,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:16,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:16,396 INFO L93 Difference]: Finished difference Result 1209 states and 1841 transitions. [2022-07-19 10:59:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 10:59:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:16,399 INFO L225 Difference]: With dead ends: 1209 [2022-07-19 10:59:16,400 INFO L226 Difference]: Without dead ends: 785 [2022-07-19 10:59:16,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:16,401 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 89 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:16,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 532 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 10:59:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-07-19 10:59:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 662. [2022-07-19 10:59:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5340393343419063) internal successors, (1014), 661 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1014 transitions. [2022-07-19 10:59:16,420 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1014 transitions. Word has length 108 [2022-07-19 10:59:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:16,421 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1014 transitions. [2022-07-19 10:59:16,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1014 transitions. [2022-07-19 10:59:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 10:59:16,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:16,423 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:16,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:59:16,423 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash -82572025, now seen corresponding path program 1 times [2022-07-19 10:59:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:16,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984161837] [2022-07-19 10:59:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:16,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:59:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:16,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984161837] [2022-07-19 10:59:16,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984161837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:16,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:16,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787998587] [2022-07-19 10:59:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:16,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:16,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:16,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:16,591 INFO L87 Difference]: Start difference. First operand 662 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:18,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:20,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:20,914 INFO L93 Difference]: Finished difference Result 1433 states and 2183 transitions. [2022-07-19 10:59:20,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:20,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 10:59:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:20,918 INFO L225 Difference]: With dead ends: 1433 [2022-07-19 10:59:20,918 INFO L226 Difference]: Without dead ends: 781 [2022-07-19 10:59:20,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:20,920 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 66 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:20,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 528 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 10:59:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-07-19 10:59:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 692. [2022-07-19 10:59:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 1.539797395079595) internal successors, (1064), 691 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1064 transitions. [2022-07-19 10:59:20,957 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1064 transitions. Word has length 108 [2022-07-19 10:59:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:20,957 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1064 transitions. [2022-07-19 10:59:20,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1064 transitions. [2022-07-19 10:59:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 10:59:20,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:20,960 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:20,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:59:20,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash 803875412, now seen corresponding path program 1 times [2022-07-19 10:59:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:20,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421256600] [2022-07-19 10:59:20,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:20,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:59:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:21,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421256600] [2022-07-19 10:59:21,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421256600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:21,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:21,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76551240] [2022-07-19 10:59:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:21,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:21,135 INFO L87 Difference]: Start difference. First operand 692 states and 1064 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:23,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:23,466 INFO L93 Difference]: Finished difference Result 1568 states and 2384 transitions. [2022-07-19 10:59:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 10:59:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:23,470 INFO L225 Difference]: With dead ends: 1568 [2022-07-19 10:59:23,470 INFO L226 Difference]: Without dead ends: 886 [2022-07-19 10:59:23,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:23,472 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 90 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:23,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:59:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-07-19 10:59:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 731. [2022-07-19 10:59:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5602739726027397) internal successors, (1139), 730 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1139 transitions. [2022-07-19 10:59:23,493 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1139 transitions. Word has length 108 [2022-07-19 10:59:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:23,493 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1139 transitions. [2022-07-19 10:59:23,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1139 transitions. [2022-07-19 10:59:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 10:59:23,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:23,495 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:23,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:59:23,496 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:23,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1155633319, now seen corresponding path program 1 times [2022-07-19 10:59:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:23,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357643625] [2022-07-19 10:59:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357643625] [2022-07-19 10:59:23,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357643625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:23,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:23,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896796124] [2022-07-19 10:59:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:23,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:23,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:23,661 INFO L87 Difference]: Start difference. First operand 731 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:25,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:27,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:27,887 INFO L93 Difference]: Finished difference Result 1239 states and 1920 transitions. [2022-07-19 10:59:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:27,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 10:59:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:27,891 INFO L225 Difference]: With dead ends: 1239 [2022-07-19 10:59:27,891 INFO L226 Difference]: Without dead ends: 774 [2022-07-19 10:59:27,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:27,893 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 39 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:27,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 486 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:59:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-07-19 10:59:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 731. [2022-07-19 10:59:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5575342465753426) internal successors, (1137), 730 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1137 transitions. [2022-07-19 10:59:27,914 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1137 transitions. Word has length 108 [2022-07-19 10:59:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:27,914 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1137 transitions. [2022-07-19 10:59:27,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1137 transitions. [2022-07-19 10:59:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 10:59:27,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:27,916 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:27,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:59:27,917 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash 446496737, now seen corresponding path program 1 times [2022-07-19 10:59:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:27,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784784776] [2022-07-19 10:59:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:28,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:28,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784784776] [2022-07-19 10:59:28,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784784776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:28,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:28,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16880596] [2022-07-19 10:59:28,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:28,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:28,090 INFO L87 Difference]: Start difference. First operand 731 states and 1137 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:30,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:32,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:32,367 INFO L93 Difference]: Finished difference Result 1523 states and 2353 transitions. [2022-07-19 10:59:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-19 10:59:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:32,371 INFO L225 Difference]: With dead ends: 1523 [2022-07-19 10:59:32,371 INFO L226 Difference]: Without dead ends: 802 [2022-07-19 10:59:32,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:32,373 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 79 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:32,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 510 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:59:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-19 10:59:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 731. [2022-07-19 10:59:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5547945205479452) internal successors, (1135), 730 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1135 transitions. [2022-07-19 10:59:32,393 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1135 transitions. Word has length 109 [2022-07-19 10:59:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:32,394 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1135 transitions. [2022-07-19 10:59:32,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1135 transitions. [2022-07-19 10:59:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 10:59:32,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:32,396 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:32,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:59:32,396 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash -585249362, now seen corresponding path program 1 times [2022-07-19 10:59:32,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:32,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606414680] [2022-07-19 10:59:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:32,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606414680] [2022-07-19 10:59:32,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606414680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:32,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:32,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637320282] [2022-07-19 10:59:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:32,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:32,574 INFO L87 Difference]: Start difference. First operand 731 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:34,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:36,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:36,831 INFO L93 Difference]: Finished difference Result 1260 states and 1943 transitions. [2022-07-19 10:59:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-19 10:59:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:36,834 INFO L225 Difference]: With dead ends: 1260 [2022-07-19 10:59:36,835 INFO L226 Difference]: Without dead ends: 795 [2022-07-19 10:59:36,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:36,836 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 72 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:36,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 502 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:59:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-07-19 10:59:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 731. [2022-07-19 10:59:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5520547945205478) internal successors, (1133), 730 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1133 transitions. [2022-07-19 10:59:36,856 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1133 transitions. Word has length 109 [2022-07-19 10:59:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:36,857 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1133 transitions. [2022-07-19 10:59:36,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1133 transitions. [2022-07-19 10:59:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 10:59:36,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:36,859 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:36,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:59:36,859 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash 147177277, now seen corresponding path program 1 times [2022-07-19 10:59:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:36,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335850681] [2022-07-19 10:59:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:59:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:37,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335850681] [2022-07-19 10:59:37,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335850681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:37,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:37,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109084411] [2022-07-19 10:59:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:37,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:37,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:37,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:37,055 INFO L87 Difference]: Start difference. First operand 731 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:39,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:39,340 INFO L93 Difference]: Finished difference Result 1601 states and 2438 transitions. [2022-07-19 10:59:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-19 10:59:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:39,344 INFO L225 Difference]: With dead ends: 1601 [2022-07-19 10:59:39,345 INFO L226 Difference]: Without dead ends: 880 [2022-07-19 10:59:39,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-19 10:59:39,346 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 87 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:39,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 266 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 207 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 10:59:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-19 10:59:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-19 10:59:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5497953615279672) internal successors, (1136), 733 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1136 transitions. [2022-07-19 10:59:39,368 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1136 transitions. Word has length 109 [2022-07-19 10:59:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:39,369 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1136 transitions. [2022-07-19 10:59:39,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1136 transitions. [2022-07-19 10:59:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 10:59:39,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:39,371 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:39,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:59:39,372 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1125768991, now seen corresponding path program 1 times [2022-07-19 10:59:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601072677] [2022-07-19 10:59:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:39,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601072677] [2022-07-19 10:59:39,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601072677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:39,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:39,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5368657] [2022-07-19 10:59:39,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:39,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:39,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:39,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:39,550 INFO L87 Difference]: Start difference. First operand 734 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:41,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:41,808 INFO L93 Difference]: Finished difference Result 1604 states and 2438 transitions. [2022-07-19 10:59:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:41,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-19 10:59:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:41,811 INFO L225 Difference]: With dead ends: 1604 [2022-07-19 10:59:41,811 INFO L226 Difference]: Without dead ends: 880 [2022-07-19 10:59:41,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:41,817 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 110 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:41,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 266 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 207 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 10:59:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-19 10:59:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-19 10:59:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.534788540245566) internal successors, (1125), 733 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1125 transitions. [2022-07-19 10:59:41,840 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1125 transitions. Word has length 109 [2022-07-19 10:59:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:41,840 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1125 transitions. [2022-07-19 10:59:41,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1125 transitions. [2022-07-19 10:59:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 10:59:41,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:41,844 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:41,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:59:41,845 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 94022892, now seen corresponding path program 1 times [2022-07-19 10:59:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:41,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043287446] [2022-07-19 10:59:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:42,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043287446] [2022-07-19 10:59:42,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043287446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:42,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:42,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810683001] [2022-07-19 10:59:42,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:42,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:42,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:42,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:42,035 INFO L87 Difference]: Start difference. First operand 734 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:44,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:46,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:46,204 INFO L93 Difference]: Finished difference Result 1219 states and 1867 transitions. [2022-07-19 10:59:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-19 10:59:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:46,207 INFO L225 Difference]: With dead ends: 1219 [2022-07-19 10:59:46,207 INFO L226 Difference]: Without dead ends: 752 [2022-07-19 10:59:46,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:46,208 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 25 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:46,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 462 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:59:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-19 10:59:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 734. [2022-07-19 10:59:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5320600272851297) internal successors, (1123), 733 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1123 transitions. [2022-07-19 10:59:46,228 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1123 transitions. Word has length 109 [2022-07-19 10:59:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:46,228 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1123 transitions. [2022-07-19 10:59:46,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1123 transitions. [2022-07-19 10:59:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 10:59:46,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:46,231 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:46,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:59:46,231 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1469182628, now seen corresponding path program 1 times [2022-07-19 10:59:46,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:46,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257782827] [2022-07-19 10:59:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:59:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257782827] [2022-07-19 10:59:46,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257782827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:46,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:46,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835112995] [2022-07-19 10:59:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:46,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:46,399 INFO L87 Difference]: Start difference. First operand 734 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:48,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:48,671 INFO L93 Difference]: Finished difference Result 1604 states and 2412 transitions. [2022-07-19 10:59:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-19 10:59:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:48,674 INFO L225 Difference]: With dead ends: 1604 [2022-07-19 10:59:48,674 INFO L226 Difference]: Without dead ends: 880 [2022-07-19 10:59:48,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:48,675 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 104 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:48,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 272 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 10:59:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-19 10:59:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-19 10:59:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5170532060027284) internal successors, (1112), 733 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1112 transitions. [2022-07-19 10:59:48,697 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1112 transitions. Word has length 110 [2022-07-19 10:59:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:48,698 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1112 transitions. [2022-07-19 10:59:48,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1112 transitions. [2022-07-19 10:59:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 10:59:48,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:48,700 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:48,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:59:48,700 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash 797770585, now seen corresponding path program 1 times [2022-07-19 10:59:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:48,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393585364] [2022-07-19 10:59:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:59:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393585364] [2022-07-19 10:59:48,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393585364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:48,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:48,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:59:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757435468] [2022-07-19 10:59:48,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:48,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:48,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:59:48,902 INFO L87 Difference]: Start difference. First operand 734 states and 1112 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:50,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:52,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:53,123 INFO L93 Difference]: Finished difference Result 1508 states and 2274 transitions. [2022-07-19 10:59:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:53,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-19 10:59:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:53,126 INFO L225 Difference]: With dead ends: 1508 [2022-07-19 10:59:53,126 INFO L226 Difference]: Without dead ends: 784 [2022-07-19 10:59:53,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:59:53,128 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 41 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:53,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 490 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:59:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-19 10:59:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 740. [2022-07-19 10:59:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.5128552097428958) internal successors, (1118), 739 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1118 transitions. [2022-07-19 10:59:53,148 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1118 transitions. Word has length 110 [2022-07-19 10:59:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:53,148 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1118 transitions. [2022-07-19 10:59:53,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1118 transitions. [2022-07-19 10:59:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 10:59:53,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:53,150 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:53,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 10:59:53,150 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1886579234, now seen corresponding path program 1 times [2022-07-19 10:59:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:53,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200789263] [2022-07-19 10:59:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:59:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200789263] [2022-07-19 10:59:53,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200789263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:53,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:53,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:59:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041229365] [2022-07-19 10:59:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:53,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:59:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:59:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:59:53,313 INFO L87 Difference]: Start difference. First operand 740 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:55,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:55,364 INFO L93 Difference]: Finished difference Result 1472 states and 2231 transitions. [2022-07-19 10:59:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:59:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-19 10:59:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:55,367 INFO L225 Difference]: With dead ends: 1472 [2022-07-19 10:59:55,367 INFO L226 Difference]: Without dead ends: 1004 [2022-07-19 10:59:55,368 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-19 10:59:55,368 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 468 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-19 10:59:55,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 10:59:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-07-19 10:59:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2022-07-19 10:59:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 1.5094715852442673) internal successors, (1514), 1003 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1514 transitions. [2022-07-19 10:59:55,393 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1514 transitions. Word has length 110 [2022-07-19 10:59:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:55,393 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1514 transitions. [2022-07-19 10:59:55,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:59:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1514 transitions. [2022-07-19 10:59:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 10:59:55,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:55,396 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:55,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 10:59:55,396 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2022-07-19 10:59:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:55,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700071150] [2022-07-19 10:59:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:59:56,439 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:59:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:59:56,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 10:59:56,810 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:59:56,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:59:56,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 10:59:56,821 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:59:56,825 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:59:56,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:59:56 BoogieIcfgContainer [2022-07-19 10:59:56,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:59:56,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:59:56,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:59:56,974 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:59:56,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:58:23" (3/4) ... [2022-07-19 10:59:56,977 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 10:59:56,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:59:56,977 INFO L158 Benchmark]: Toolchain (without parser) took 97999.44ms. Allocated memory was 90.2MB in the beginning and 207.6MB in the end (delta: 117.4MB). Free memory was 66.8MB in the beginning and 82.2MB in the end (delta: -15.4MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2022-07-19 10:59:56,982 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:59:56,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.76ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 47.3MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-19 10:59:56,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.03ms. Allocated memory is still 90.2MB. Free memory was 47.1MB in the beginning and 42.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:59:56,986 INFO L158 Benchmark]: Boogie Preprocessor took 115.97ms. Allocated memory was 90.2MB in the beginning and 130.0MB in the end (delta: 39.8MB). Free memory was 42.5MB in the beginning and 102.7MB in the end (delta: -60.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-07-19 10:59:56,987 INFO L158 Benchmark]: RCFGBuilder took 3373.64ms. Allocated memory is still 130.0MB. Free memory was 102.7MB in the beginning and 71.3MB in the end (delta: 31.3MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2022-07-19 10:59:56,987 INFO L158 Benchmark]: TraceAbstraction took 93867.45ms. Allocated memory was 130.0MB in the beginning and 207.6MB in the end (delta: 77.6MB). Free memory was 70.3MB in the beginning and 83.2MB in the end (delta: -12.9MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2022-07-19 10:59:56,987 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 207.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:59:56,988 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.21ms. Allocated memory is still 90.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.76ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 47.3MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.03ms. Allocated memory is still 90.2MB. Free memory was 47.1MB in the beginning and 42.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.97ms. Allocated memory was 90.2MB in the beginning and 130.0MB in the end (delta: 39.8MB). Free memory was 42.5MB in the beginning and 102.7MB in the end (delta: -60.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * RCFGBuilder took 3373.64ms. Allocated memory is still 130.0MB. Free memory was 102.7MB in the beginning and 71.3MB in the end (delta: 31.3MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. * TraceAbstraction took 93867.45ms. Allocated memory was 130.0MB in the beginning and 207.6MB in the end (delta: 77.6MB). Free memory was 70.3MB in the beginning and 83.2MB in the end (delta: -12.9MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 207.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->version=8, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->init_buf={0:-4}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1325] COND FALSE !(ret <= 0) [L1330] s->state = 4384 [L1331] s->init_num = 0 [L1332] EXPR s->bbio [L1332] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->bbio={0:5}, s->wbio={0:-3}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1332] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1340] ret = __VERIFIER_nondet_int() [L1341] COND TRUE blastFlag == 1 [L1342] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967353, (s->s3)->tmp.new_cipher={-7:0}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 93.7s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 85.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 2305 SdHoareTripleChecker+Valid, 84.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2305 mSDsluCounter, 10866 SdHoareTripleChecker+Invalid, 83.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6243 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4770 IncrementalHoareTripleChecker+Invalid, 5352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 4623 mSDtfsCounter, 4770 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred in iteration=27, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 2898 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2666 NumberOfCodeBlocks, 2666 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2527 ConstructedInterpolants, 0 QuantifiedInterpolants, 6161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 2634/2634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 10:59:57,034 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.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:59:58,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:59:58,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:59:58,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:59:58,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:59:58,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:59:58,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:59:58,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:59:58,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:59:59,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:59:59,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:59:59,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:59:59,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:59:59,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:59:59,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:59:59,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:59:59,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:59:59,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:59:59,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:59:59,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:59:59,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:59:59,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:59:59,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:59:59,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:59:59,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:59:59,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:59:59,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:59:59,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:59:59,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:59:59,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:59:59,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:59:59,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:59:59,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:59:59,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:59:59,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:59:59,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:59:59,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:59:59,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:59:59,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:59:59,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:59:59,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:59:59,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:59:59,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 10:59:59,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:59:59,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:59:59,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:59:59,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:59:59,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:59:59,076 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:59:59,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:59:59,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:59:59,077 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:59:59,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:59:59,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:59:59,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:59:59,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:59:59,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:59:59,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:59:59,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:59:59,079 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 10:59:59,079 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 10:59:59,080 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 10:59:59,080 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:59:59,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:59:59,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:59:59,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:59:59,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:59:59,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:59:59,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:59:59,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:59:59,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:59:59,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:59:59,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:59:59,082 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 10:59:59,082 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 10:59:59,082 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:59:59,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:59:59,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:59:59,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 10:59:59,083 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 -> cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 [2022-07-19 10:59:59,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:59:59,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:59:59,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:59:59,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:59:59,448 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:59:59,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-19 10:59:59,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d96ca514/fc84165b5c9e426bad2ebe83a4afe20d/FLAG3d351bf04 [2022-07-19 11:00:00,106 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:00:00,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-19 11:00:00,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d96ca514/fc84165b5c9e426bad2ebe83a4afe20d/FLAG3d351bf04 [2022-07-19 11:00:00,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d96ca514/fc84165b5c9e426bad2ebe83a4afe20d [2022-07-19 11:00:00,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:00:00,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:00:00,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:00:00,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:00:00,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:00:00,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:00:00" (1/1) ... [2022-07-19 11:00:00,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199248a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:00, skipping insertion in model container [2022-07-19 11:00:00,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:00:00" (1/1) ... [2022-07-19 11:00:00,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:00:00,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:00:00,821 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.02.i.cil-1.c[65397,65410] [2022-07-19 11:00:00,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:00:00,845 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 11:00:00,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:00:00,933 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.02.i.cil-1.c[65397,65410] [2022-07-19 11:00:00,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:00:00,943 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:00:01,055 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.02.i.cil-1.c[65397,65410] [2022-07-19 11:00:01,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:00:01,087 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:00:01,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01 WrapperNode [2022-07-19 11:00:01,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:00:01,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:00:01,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:00:01,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:00:01,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,177 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-07-19 11:00:01,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:00:01,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:00:01,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:00:01,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:00:01,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:00:01,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:00:01,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:00:01,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:00:01,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (1/1) ... [2022-07-19 11:00:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:00:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:00:01,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 11:00:01,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 11:00:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:00:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 11:00:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:00:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 11:00:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:00:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:00:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:00:01,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:00:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 11:00:01,509 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:00:01,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:00:01,523 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:00:09,106 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-19 11:00:09,106 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-19 11:00:09,107 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:00:09,113 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:00:09,113 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:00:09,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:00:09 BoogieIcfgContainer [2022-07-19 11:00:09,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:00:09,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:00:09,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:00:09,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:00:09,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:00:00" (1/3) ... [2022-07-19 11:00:09,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2144520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:00:09, skipping insertion in model container [2022-07-19 11:00:09,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:01" (2/3) ... [2022-07-19 11:00:09,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2144520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:00:09, skipping insertion in model container [2022-07-19 11:00:09,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:00:09" (3/3) ... [2022-07-19 11:00:09,123 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-07-19 11:00:09,136 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:00:09,137 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:00:09,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:00:09,186 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@5a777666, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@749ef8dc [2022-07-19 11:00:09,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:00:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 11:00:09,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:09,199 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-19 11:00:09,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-19 11:00:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:00:09,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062951298] [2022-07-19 11:00:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:09,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:00:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:00:09,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:00:09,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 11:00:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:09,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:00:09,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:00:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:00:10,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:00:10,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:00:10,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062951298] [2022-07-19 11:00:10,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062951298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:10,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:10,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:00:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212388771] [2022-07-19 11:00:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:10,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:00:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:00:10,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:00:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:00:10,221 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:10,350 INFO L93 Difference]: Finished difference Result 368 states and 621 transitions. [2022-07-19 11:00:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:00:10,353 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-19 11:00:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:10,367 INFO L225 Difference]: With dead ends: 368 [2022-07-19 11:00:10,367 INFO L226 Difference]: Without dead ends: 212 [2022-07-19 11:00:10,371 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-19 11:00:10,377 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 179 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:10,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 401 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:00:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-19 11:00:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-07-19 11:00:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.4976303317535544) internal successors, (316), 211 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2022-07-19 11:00:10,460 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 24 [2022-07-19 11:00:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:10,461 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2022-07-19 11:00:10,461 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-19 11:00:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2022-07-19 11:00:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 11:00:10,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:10,467 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-19 11:00:10,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 11:00:10,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:00:10,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1509035189, now seen corresponding path program 1 times [2022-07-19 11:00:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:00:10,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750035208] [2022-07-19 11:00:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:00:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:00:10,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:00:10,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 11:00:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:11,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:00:11,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:00:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:00:11,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:00:11,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:00:11,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750035208] [2022-07-19 11:00:11,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750035208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:11,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:11,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:00:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948155340] [2022-07-19 11:00:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:11,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:00:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:00:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:00:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:00:11,747 INFO L87 Difference]: Start difference. First operand 212 states and 316 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-19 11:00:13,772 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-19 11:00:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:13,886 INFO L93 Difference]: Finished difference Result 417 states and 627 transitions. [2022-07-19 11:00:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:00:13,887 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-19 11:00:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:13,888 INFO L225 Difference]: With dead ends: 417 [2022-07-19 11:00:13,888 INFO L226 Difference]: Without dead ends: 312 [2022-07-19 11:00:13,889 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-19 11:00:13,890 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 460 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-19 11:00:13,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 460 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:00:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-19 11:00:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-19 11:00:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.4887459807073955) internal successors, (463), 311 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2022-07-19 11:00:13,904 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 39 [2022-07-19 11:00:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:13,904 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2022-07-19 11:00:13,904 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-19 11:00:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2022-07-19 11:00:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 11:00:13,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:13,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:13,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 11:00:14,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:00:14,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1699665034, now seen corresponding path program 1 times [2022-07-19 11:00:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:00:14,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756692453] [2022-07-19 11:00:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:00:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:00:14,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:00:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 11:00:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:15,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:00:15,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:00:15,197 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-19 11:00:15,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:00:15,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:00:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756692453] [2022-07-19 11:00:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756692453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:15,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:15,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:00:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067120253] [2022-07-19 11:00:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:15,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:00:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:00:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:00:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:00:15,199 INFO L87 Difference]: Start difference. First operand 312 states and 463 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-19 11:00:17,223 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-19 11:00:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:17,355 INFO L93 Difference]: Finished difference Result 619 states and 924 transitions. [2022-07-19 11:00:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:00:17,357 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-19 11:00:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:17,359 INFO L225 Difference]: With dead ends: 619 [2022-07-19 11:00:17,359 INFO L226 Difference]: Without dead ends: 414 [2022-07-19 11:00:17,360 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-19 11:00:17,361 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 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-19 11:00:17,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:00:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-19 11:00:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-19 11:00:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4842615012106537) internal successors, (613), 413 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-07-19 11:00:17,389 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-07-19 11:00:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:17,390 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-07-19 11:00:17,390 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-19 11:00:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-07-19 11:00:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 11:00:17,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:17,409 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-19 11:00:17,445 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-19 11:00:17,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:00:17,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1132708561, now seen corresponding path program 1 times [2022-07-19 11:00:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:00:17,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170556241] [2022-07-19 11:00:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:17,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:00:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:00:17,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:00:17,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 11:00:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:18,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:00:18,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:00:18,831 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-19 11:00:18,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:00:18,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:00:18,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170556241] [2022-07-19 11:00:18,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170556241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:18,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:18,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:00:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361494642] [2022-07-19 11:00:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:00:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:00:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:00:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:00:18,833 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:20,852 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-19 11:00:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:20,957 INFO L93 Difference]: Finished difference Result 822 states and 1223 transitions. [2022-07-19 11:00:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:00:20,957 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-19 11:00:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:20,960 INFO L225 Difference]: With dead ends: 822 [2022-07-19 11:00:20,960 INFO L226 Difference]: Without dead ends: 515 [2022-07-19 11:00:20,961 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-19 11:00:20,962 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:20,962 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-19 11:00:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-19 11:00:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-07-19 11:00:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.482490272373541) internal successors, (762), 514 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-07-19 11:00:21,016 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-07-19 11:00:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:21,017 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-07-19 11:00:21,017 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-19 11:00:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-07-19 11:00:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 11:00:21,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:21,022 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-19 11:00:21,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 11:00:21,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:00:21,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2022-07-19 11:00:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:00:21,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357259395] [2022-07-19 11:00:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:21,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:00:21,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:00:21,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:00:21,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 11:00:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:22,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 11:00:22,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:00:24,114 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-19 11:00:24,115 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-19 11:00:43,019 WARN L233 SmtUtils]: Spent 18.78s 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-19 11:00:43,021 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-19 11:00:43,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 4790 treesize of output 4750 [2022-07-19 11:00:43,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4345 treesize of output 3031 [2022-07-19 11:00:43,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 11:00:43,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2466 treesize of output 1710 [2022-07-19 11:00:44,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 11:00:44,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 968 treesize of output 891 [2022-07-19 11:00:45,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:45,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:46,233 INFO L244 Elim1Store]: Index analysis took 879 ms [2022-07-19 11:00:46,861 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-19 11:00:47,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:47,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:47,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:47,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:48,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:49,307 INFO L244 Elim1Store]: Index analysis took 1628 ms [2022-07-19 11:00:50,086 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-19 11:00:50,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:00:50,980 INFO L244 Elim1Store]: Index analysis took 616 ms [2022-07-19 11:00:51,721 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-19 11:00:52,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 371 [2022-07-19 11:00:52,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 123 [2022-07-19 11:00:53,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115