./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/s3.i --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/loops/s3.i -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 d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:55:12,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:55:12,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:55:12,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:55:12,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:55:12,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:55:12,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:55:12,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:55:12,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:55:12,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:55:12,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:55:12,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:55:12,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:55:12,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:55:12,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:55:12,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:55:12,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:55:12,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:55:12,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:55:12,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:55:12,617 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:55:12,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:55:12,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:55:12,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:55:12,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:55:12,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:55:12,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:55:12,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:55:12,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:55:12,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:55:12,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:55:12,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:55:12,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:55:12,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:55:12,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:55:12,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:55:12,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:55:12,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:55:12,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:55:12,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:55:12,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:55:12,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:55:12,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:55:12,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:55:12,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:55:12,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:55:12,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:55:12,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:55:12,661 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:55:12,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:55:12,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:55:12,662 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:55:12,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:55:12,663 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:55:12,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:55:12,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:55:12,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:55:12,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:55:12,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:55:12,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:55:12,664 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:55:12,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:55:12,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:55:12,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:55:12,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:55:12,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:55:12,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:55:12,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:55:12,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:55:12,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:55:12,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:55:12,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:55:12,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:55:12,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:55:12,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:55:12,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:55:12,667 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 -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-19 14:55:12,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:55:12,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:55:12,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:55:12,876 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:55:12,888 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:55:12,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-19 14:55:12,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaeb2974b/6ccfaa63cdab4f969ab163a9a8faf7a2/FLAG08072c08f [2022-07-19 14:55:13,357 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:55:13,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-19 14:55:13,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaeb2974b/6ccfaa63cdab4f969ab163a9a8faf7a2/FLAG08072c08f [2022-07-19 14:55:13,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaeb2974b/6ccfaa63cdab4f969ab163a9a8faf7a2 [2022-07-19 14:55:13,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:55:13,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:55:13,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:55:13,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:55:13,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:55:13,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:13,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6baeafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13, skipping insertion in model container [2022-07-19 14:55:13,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:13,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:55:13,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:55:13,770 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/loops/s3.i[64167,64180] [2022-07-19 14:55:13,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:55:13,796 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:55:13,857 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/loops/s3.i[64167,64180] [2022-07-19 14:55:13,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:55:13,881 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:55:13,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13 WrapperNode [2022-07-19 14:55:13,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:55:13,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:55:13,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:55:13,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:55:13,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:13,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:13,971 INFO L137 Inliner]: procedures = 30, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 732 [2022-07-19 14:55:13,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:55:13,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:55:13,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:55:13,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:55:13,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:13,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:14,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:14,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:14,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:14,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:14,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:14,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:55:14,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:55:14,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:55:14,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:55:14,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (1/1) ... [2022-07-19 14:55:14,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:55:14,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:55:14,131 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 14:55:14,159 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 14:55:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:55:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:55:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:55:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:55:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:55:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:55:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:55:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:55:14,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:55:14,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:55:14,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:55:14,359 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 14:55:17,027 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-19 14:55:17,027 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-19 14:55:17,028 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:55:17,033 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:55:17,033 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 14:55:17,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:55:17 BoogieIcfgContainer [2022-07-19 14:55:17,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:55:17,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:55:17,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:55:17,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:55:17,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:55:13" (1/3) ... [2022-07-19 14:55:17,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79289216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:55:17, skipping insertion in model container [2022-07-19 14:55:17,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:55:13" (2/3) ... [2022-07-19 14:55:17,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79289216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:55:17, skipping insertion in model container [2022-07-19 14:55:17,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:55:17" (3/3) ... [2022-07-19 14:55:17,039 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-19 14:55:17,054 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:55:17,054 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:55:17,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:55:17,105 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@d89c2b7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c7df431 [2022-07-19 14:55:17,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:55:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:55:17,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:17,114 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 14:55:17,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-19 14:55:17,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:17,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837075299] [2022-07-19 14:55:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:17,593 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 14:55:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:17,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837075299] [2022-07-19 14:55:17,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837075299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:17,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:17,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:55:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853374437] [2022-07-19 14:55:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:17,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:55:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:17,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:55:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:55:17,626 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:17,685 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-19 14:55:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:55:17,688 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 14:55:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:17,696 INFO L225 Difference]: With dead ends: 375 [2022-07-19 14:55:17,696 INFO L226 Difference]: Without dead ends: 217 [2022-07-19 14:55:17,699 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 14:55:17,702 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:17,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:55:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-19 14:55:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-19 14:55:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-19 14:55:17,743 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-19 14:55:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:17,744 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-19 14:55:17,744 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 14:55:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-19 14:55:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:55:17,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:17,746 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 14:55:17,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:55:17,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-19 14:55:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:17,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795952748] [2022-07-19 14:55:17,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:17,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:17,959 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 14:55:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:17,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795952748] [2022-07-19 14:55:17,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795952748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:17,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:17,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:17,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766884494] [2022-07-19 14:55:17,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:17,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:17,962 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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 14:55:19,977 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 14:55:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:20,247 INFO L93 Difference]: Finished difference Result 612 states and 909 transitions. [2022-07-19 14:55:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:20,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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 14:55:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:20,250 INFO L225 Difference]: With dead ends: 612 [2022-07-19 14:55:20,250 INFO L226 Difference]: Without dead ends: 402 [2022-07-19 14:55:20,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:20,252 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:20,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 271 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 14:55:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-19 14:55:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 265. [2022-07-19 14:55:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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 14:55:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2022-07-19 14:55:20,281 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 39 [2022-07-19 14:55:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:20,283 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2022-07-19 14:55:20,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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 14:55:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2022-07-19 14:55:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:55:20,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:20,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:55:20,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:55:20,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -228723188, now seen corresponding path program 1 times [2022-07-19 14:55:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:20,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279549865] [2022-07-19 14:55:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:20,425 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 14:55:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:20,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279549865] [2022-07-19 14:55:20,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279549865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:20,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:20,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947260814] [2022-07-19 14:55:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:20,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:20,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:20,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:20,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:20,428 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 14:55:22,435 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 14:55:24,447 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 14:55:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:24,621 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2022-07-19 14:55:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:24,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-07-19 14:55:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:24,623 INFO L225 Difference]: With dead ends: 431 [2022-07-19 14:55:24,623 INFO L226 Difference]: Without dead ends: 300 [2022-07-19 14:55:24,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:24,624 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:24,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 476 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 14:55:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-19 14:55:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2022-07-19 14:55:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5425531914893618) internal successors, (435), 282 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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 14:55:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2022-07-19 14:55:24,635 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 40 [2022-07-19 14:55:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:24,635 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2022-07-19 14:55:24,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 14:55:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2022-07-19 14:55:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 14:55:24,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:24,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:55:24,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:55:24,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1727416149, now seen corresponding path program 1 times [2022-07-19 14:55:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:24,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349382890] [2022-07-19 14:55:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:55:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:24,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349382890] [2022-07-19 14:55:24,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349382890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:24,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:24,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6135300] [2022-07-19 14:55:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:24,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:24,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:24,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:24,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:24,795 INFO L87 Difference]: Start difference. First operand 283 states and 435 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 14:55:26,805 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 14:55:28,818 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 14:55:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:29,116 INFO L93 Difference]: Finished difference Result 758 states and 1164 transitions. [2022-07-19 14:55:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:29,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-07-19 14:55:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:29,118 INFO L225 Difference]: With dead ends: 758 [2022-07-19 14:55:29,118 INFO L226 Difference]: Without dead ends: 482 [2022-07-19 14:55:29,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:29,119 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 113 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:29,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 501 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 14:55:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-19 14:55:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 308. [2022-07-19 14:55:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.52442996742671) internal successors, (468), 307 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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 14:55:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 468 transitions. [2022-07-19 14:55:29,136 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 468 transitions. Word has length 55 [2022-07-19 14:55:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:29,137 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 468 transitions. [2022-07-19 14:55:29,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 14:55:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 468 transitions. [2022-07-19 14:55:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 14:55:29,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:29,140 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-19 14:55:29,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:55:29,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:29,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1149096951, now seen corresponding path program 1 times [2022-07-19 14:55:29,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:29,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602529831] [2022-07-19 14:55:29,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:55:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602529831] [2022-07-19 14:55:29,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602529831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:29,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:29,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:29,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273170254] [2022-07-19 14:55:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:29,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:29,253 INFO L87 Difference]: Start difference. First operand 308 states and 468 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 14:55:31,267 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 14:55:33,279 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 14:55:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:33,459 INFO L93 Difference]: Finished difference Result 484 states and 735 transitions. [2022-07-19 14:55:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-07-19 14:55:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:33,461 INFO L225 Difference]: With dead ends: 484 [2022-07-19 14:55:33,461 INFO L226 Difference]: Without dead ends: 324 [2022-07-19 14:55:33,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:33,462 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:33,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 474 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 14:55:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-19 14:55:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2022-07-19 14:55:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2022-07-19 14:55:33,469 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 55 [2022-07-19 14:55:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:33,470 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2022-07-19 14:55:33,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 14:55:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2022-07-19 14:55:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 14:55:33,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:33,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:55:33,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:55:33,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1382837768, now seen corresponding path program 1 times [2022-07-19 14:55:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:33,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540435135] [2022-07-19 14:55:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:55:33,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:33,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540435135] [2022-07-19 14:55:33,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540435135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:33,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:33,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983606090] [2022-07-19 14:55:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:33,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:33,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:33,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:33,613 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 14:55:35,630 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 14:55:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:35,853 INFO L93 Difference]: Finished difference Result 768 states and 1162 transitions. [2022-07-19 14:55:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:35,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-19 14:55:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:35,855 INFO L225 Difference]: With dead ends: 768 [2022-07-19 14:55:35,855 INFO L226 Difference]: Without dead ends: 470 [2022-07-19 14:55:35,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:35,856 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 292 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:35,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 292 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 14:55:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-19 14:55:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 312. [2022-07-19 14:55:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5112540192926045) internal successors, (470), 311 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 470 transitions. [2022-07-19 14:55:35,863 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 470 transitions. Word has length 56 [2022-07-19 14:55:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:35,863 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 470 transitions. [2022-07-19 14:55:35,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 14:55:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 470 transitions. [2022-07-19 14:55:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 14:55:35,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:35,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:55:35,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 14:55:35,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash 270979954, now seen corresponding path program 1 times [2022-07-19 14:55:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:35,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059904731] [2022-07-19 14:55:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:55:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:35,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059904731] [2022-07-19 14:55:35,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059904731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:35,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:35,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091816791] [2022-07-19 14:55:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:35,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:35,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:35,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:35,958 INFO L87 Difference]: Start difference. First operand 312 states and 470 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:37,971 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 14:55:39,984 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 14:55:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:40,155 INFO L93 Difference]: Finished difference Result 490 states and 737 transitions. [2022-07-19 14:55:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-19 14:55:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:40,162 INFO L225 Difference]: With dead ends: 490 [2022-07-19 14:55:40,162 INFO L226 Difference]: Without dead ends: 328 [2022-07-19 14:55:40,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:40,163 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:40,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 470 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 14:55:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-19 14:55:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 312. [2022-07-19 14:55:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5080385852090032) internal successors, (469), 311 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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 14:55:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 469 transitions. [2022-07-19 14:55:40,170 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 469 transitions. Word has length 57 [2022-07-19 14:55:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:40,170 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 469 transitions. [2022-07-19 14:55:40,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 469 transitions. [2022-07-19 14:55:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 14:55:40,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:40,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:55:40,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 14:55:40,172 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1460862829, now seen corresponding path program 1 times [2022-07-19 14:55:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:40,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873667020] [2022-07-19 14:55:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:40,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:55:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:40,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873667020] [2022-07-19 14:55:40,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873667020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:40,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:40,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316327631] [2022-07-19 14:55:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:40,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:40,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:40,272 INFO L87 Difference]: Start difference. First operand 312 states and 469 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:42,279 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 14:55:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:42,523 INFO L93 Difference]: Finished difference Result 772 states and 1158 transitions. [2022-07-19 14:55:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:42,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-19 14:55:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:42,525 INFO L225 Difference]: With dead ends: 772 [2022-07-19 14:55:42,525 INFO L226 Difference]: Without dead ends: 470 [2022-07-19 14:55:42,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:42,526 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:42,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 14:55:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-19 14:55:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 316. [2022-07-19 14:55:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4984126984126984) internal successors, (472), 315 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 14:55:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2022-07-19 14:55:42,533 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 58 [2022-07-19 14:55:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:42,534 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2022-07-19 14:55:42,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2022-07-19 14:55:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 14:55:42,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:42,535 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, 1] [2022-07-19 14:55:42,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 14:55:42,535 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1518169684, now seen corresponding path program 1 times [2022-07-19 14:55:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:42,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659249162] [2022-07-19 14:55:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:42,616 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 14:55:42,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:42,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659249162] [2022-07-19 14:55:42,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659249162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:42,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:42,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:55:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137932990] [2022-07-19 14:55:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:42,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:55:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:55:42,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:55:42,619 INFO L87 Difference]: Start difference. First operand 316 states and 472 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 14:55:44,631 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 14:55:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:44,672 INFO L93 Difference]: Finished difference Result 641 states and 962 transitions. [2022-07-19 14:55:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:55:44,673 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 58 [2022-07-19 14:55:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:44,676 INFO L225 Difference]: With dead ends: 641 [2022-07-19 14:55:44,676 INFO L226 Difference]: Without dead ends: 477 [2022-07-19 14:55:44,676 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 14:55:44,678 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:44,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 14:55:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-19 14:55:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2022-07-19 14:55:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4915966386554622) internal successors, (710), 476 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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 14:55:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 710 transitions. [2022-07-19 14:55:44,689 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 710 transitions. Word has length 58 [2022-07-19 14:55:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:44,690 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 710 transitions. [2022-07-19 14:55:44,690 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 14:55:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 710 transitions. [2022-07-19 14:55:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 14:55:44,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:44,691 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, 1] [2022-07-19 14:55:44,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 14:55:44,692 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash -853569578, now seen corresponding path program 1 times [2022-07-19 14:55:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:44,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83687518] [2022-07-19 14:55:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:44,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:55:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:44,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83687518] [2022-07-19 14:55:44,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83687518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:44,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:44,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:55:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608337280] [2022-07-19 14:55:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:44,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:55:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:55:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:55:44,788 INFO L87 Difference]: Start difference. First operand 477 states and 710 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 14:55:46,803 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 14:55:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:46,833 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2022-07-19 14:55:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:55:46,834 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 58 [2022-07-19 14:55:46,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:46,835 INFO L225 Difference]: With dead ends: 826 [2022-07-19 14:55:46,835 INFO L226 Difference]: Without dead ends: 501 [2022-07-19 14:55:46,836 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 14:55:46,836 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:46,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 354 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 14:55:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-07-19 14:55:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-07-19 14:55:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.484) internal successors, (742), 500 states have internal predecessors, (742), 0 states have call successors, (0), 0 states 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 14:55:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 742 transitions. [2022-07-19 14:55:46,873 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 742 transitions. Word has length 58 [2022-07-19 14:55:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:46,873 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 742 transitions. [2022-07-19 14:55:46,874 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 14:55:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 742 transitions. [2022-07-19 14:55:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-19 14:55:46,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:46,875 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, 1] [2022-07-19 14:55:46,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 14:55:46,875 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -533479020, now seen corresponding path program 1 times [2022-07-19 14:55:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:46,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357799645] [2022-07-19 14:55:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 14:55:46,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:46,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357799645] [2022-07-19 14:55:46,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357799645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:46,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:46,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094415967] [2022-07-19 14:55:46,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:46,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:46,976 INFO L87 Difference]: Start difference. First operand 501 states and 742 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 14:55:48,984 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 14:55:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:49,214 INFO L93 Difference]: Finished difference Result 1297 states and 1926 transitions. [2022-07-19 14:55:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:49,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-19 14:55:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:49,217 INFO L225 Difference]: With dead ends: 1297 [2022-07-19 14:55:49,218 INFO L226 Difference]: Without dead ends: 806 [2022-07-19 14:55:49,218 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 14:55:49,219 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:49,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 14:55:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-07-19 14:55:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 579. [2022-07-19 14:55:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4965397923875432) internal successors, (865), 578 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 865 transitions. [2022-07-19 14:55:49,231 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 865 transitions. Word has length 78 [2022-07-19 14:55:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:49,231 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 865 transitions. [2022-07-19 14:55:49,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 14:55:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 865 transitions. [2022-07-19 14:55:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-19 14:55:49,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:49,235 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, 1] [2022-07-19 14:55:49,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 14:55:49,235 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 360007318, now seen corresponding path program 1 times [2022-07-19 14:55:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446214489] [2022-07-19 14:55:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:49,365 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 14:55:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:49,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446214489] [2022-07-19 14:55:49,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446214489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:49,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:49,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174509311] [2022-07-19 14:55:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:49,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:49,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:49,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:49,367 INFO L87 Difference]: Start difference. First operand 579 states and 865 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 14:55:51,379 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 14:55:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:51,638 INFO L93 Difference]: Finished difference Result 1363 states and 2022 transitions. [2022-07-19 14:55:51,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:51,639 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 78 [2022-07-19 14:55:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:51,641 INFO L225 Difference]: With dead ends: 1363 [2022-07-19 14:55:51,641 INFO L226 Difference]: Without dead ends: 794 [2022-07-19 14:55:51,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:51,642 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:51,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 14:55:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-19 14:55:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 594. [2022-07-19 14:55:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 593 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 892 transitions. [2022-07-19 14:55:51,655 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 892 transitions. Word has length 78 [2022-07-19 14:55:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:51,656 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 892 transitions. [2022-07-19 14:55:51,656 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 14:55:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 892 transitions. [2022-07-19 14:55:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-19 14:55:51,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:51,657 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, 1, 1] [2022-07-19 14:55:51,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 14:55:51,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1728932100, now seen corresponding path program 1 times [2022-07-19 14:55:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:51,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662276502] [2022-07-19 14:55:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:51,788 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 14:55:51,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:51,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662276502] [2022-07-19 14:55:51,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662276502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:51,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:51,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:51,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316002900] [2022-07-19 14:55:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:51,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:51,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:51,790 INFO L87 Difference]: Start difference. First operand 594 states and 892 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 14:55:53,800 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 14:55:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:54,079 INFO L93 Difference]: Finished difference Result 1453 states and 2163 transitions. [2022-07-19 14:55:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:54,079 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 79 [2022-07-19 14:55:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:54,082 INFO L225 Difference]: With dead ends: 1453 [2022-07-19 14:55:54,083 INFO L226 Difference]: Without dead ends: 869 [2022-07-19 14:55:54,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:54,084 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:54,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 14:55:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-19 14:55:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 672. [2022-07-19 14:55:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.5081967213114753) internal successors, (1012), 671 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states 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 14:55:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1012 transitions. [2022-07-19 14:55:54,103 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1012 transitions. Word has length 79 [2022-07-19 14:55:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:54,103 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1012 transitions. [2022-07-19 14:55:54,103 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 14:55:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1012 transitions. [2022-07-19 14:55:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 14:55:54,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:54,105 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, 1, 1, 1] [2022-07-19 14:55:54,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 14:55:54,105 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2061764687, now seen corresponding path program 1 times [2022-07-19 14:55:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:54,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698115185] [2022-07-19 14:55:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:54,217 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 14:55:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:54,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698115185] [2022-07-19 14:55:54,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698115185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:54,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:54,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269820545] [2022-07-19 14:55:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:54,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:54,220 INFO L87 Difference]: Start difference. First operand 672 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:56,229 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 14:55:58,246 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 14:55:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:55:58,509 INFO L93 Difference]: Finished difference Result 1471 states and 2201 transitions. [2022-07-19 14:55:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:55:58,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-07-19 14:55:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:55:58,512 INFO L225 Difference]: With dead ends: 1471 [2022-07-19 14:55:58,512 INFO L226 Difference]: Without dead ends: 809 [2022-07-19 14:55:58,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:55:58,514 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:55:58,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 496 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 14:55:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-19 14:55:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-19 14:55:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5115332428765265) internal successors, (1114), 737 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states 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 14:55:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2022-07-19 14:55:58,538 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 80 [2022-07-19 14:55:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:55:58,539 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2022-07-19 14:55:58,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:55:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2022-07-19 14:55:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-19 14:55:58,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:55:58,540 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:55:58,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 14:55:58,541 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:55:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:55:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash 793593224, now seen corresponding path program 1 times [2022-07-19 14:55:58,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:55:58,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142925207] [2022-07-19 14:55:58,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:55:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:55:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:55:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 14:55:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:55:58,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142925207] [2022-07-19 14:55:58,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142925207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:55:58,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:55:58,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:55:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993794001] [2022-07-19 14:55:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:55:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:55:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:55:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:55:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:55:58,636 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:00,644 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 14:56:02,655 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 14:56:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:02,843 INFO L93 Difference]: Finished difference Result 1537 states and 2300 transitions. [2022-07-19 14:56:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:56:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-19 14:56:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:02,846 INFO L225 Difference]: With dead ends: 1537 [2022-07-19 14:56:02,847 INFO L226 Difference]: Without dead ends: 809 [2022-07-19 14:56:02,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:56:02,849 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 48 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:02,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 496 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 14:56:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-19 14:56:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-19 14:56:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.507462686567164) internal successors, (1111), 737 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states 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 14:56:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1111 transitions. [2022-07-19 14:56:02,871 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1111 transitions. Word has length 95 [2022-07-19 14:56:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:02,871 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1111 transitions. [2022-07-19 14:56:02,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1111 transitions. [2022-07-19 14:56:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 14:56:02,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:02,874 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:56:02,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 14:56:02,874 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1231158467, now seen corresponding path program 1 times [2022-07-19 14:56:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:56:02,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722956746] [2022-07-19 14:56:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:56:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 14:56:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:56:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722956746] [2022-07-19 14:56:02,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722956746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:02,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:02,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:56:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523757428] [2022-07-19 14:56:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:02,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:56:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:56:02,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:56:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:56:02,979 INFO L87 Difference]: Start difference. First operand 738 states and 1111 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 14:56:04,986 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 14:56:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:05,242 INFO L93 Difference]: Finished difference Result 1666 states and 2484 transitions. [2022-07-19 14:56:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:56:05,243 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 97 [2022-07-19 14:56:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:05,245 INFO L225 Difference]: With dead ends: 1666 [2022-07-19 14:56:05,246 INFO L226 Difference]: Without dead ends: 938 [2022-07-19 14:56:05,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:56:05,247 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:05,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 272 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 14:56:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-19 14:56:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 738. [2022-07-19 14:56:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4871099050203527) internal successors, (1096), 737 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states 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 14:56:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1096 transitions. [2022-07-19 14:56:05,263 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1096 transitions. Word has length 97 [2022-07-19 14:56:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:05,264 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1096 transitions. [2022-07-19 14:56:05,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1096 transitions. [2022-07-19 14:56:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 14:56:05,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:05,265 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:56:05,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 14:56:05,266 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1142724731, now seen corresponding path program 1 times [2022-07-19 14:56:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:56:05,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057787247] [2022-07-19 14:56:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:56:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 14:56:05,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:56:05,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057787247] [2022-07-19 14:56:05,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057787247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:05,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:05,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:56:05,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395036386] [2022-07-19 14:56:05,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:56:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:56:05,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:56:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:56:05,390 INFO L87 Difference]: Start difference. First operand 738 states and 1096 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 14:56:07,398 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 14:56:09,411 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 14:56:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:09,580 INFO L93 Difference]: Finished difference Result 1510 states and 2231 transitions. [2022-07-19 14:56:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:56:09,581 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 98 [2022-07-19 14:56:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:09,584 INFO L225 Difference]: With dead ends: 1510 [2022-07-19 14:56:09,584 INFO L226 Difference]: Without dead ends: 782 [2022-07-19 14:56:09,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:56:09,585 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:09,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 14:56:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-07-19 14:56:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 738. [2022-07-19 14:56:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4830393487109905) internal successors, (1093), 737 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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 14:56:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1093 transitions. [2022-07-19 14:56:09,610 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1093 transitions. Word has length 98 [2022-07-19 14:56:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:09,610 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1093 transitions. [2022-07-19 14:56:09,611 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 14:56:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1093 transitions. [2022-07-19 14:56:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 14:56:09,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:09,612 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 14:56:09,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 14:56:09,612 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2022-07-19 14:56:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:56:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16543836] [2022-07-19 14:56:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:56:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:56:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:56:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16543836] [2022-07-19 14:56:09,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16543836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:09,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:09,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:56:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396009723] [2022-07-19 14:56:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:09,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:56:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:56:09,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:56:09,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:09,723 INFO L87 Difference]: Start difference. First operand 738 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:11,730 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 14:56:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:11,766 INFO L93 Difference]: Finished difference Result 1485 states and 2202 transitions. [2022-07-19 14:56:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:56:11,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-19 14:56:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:11,769 INFO L225 Difference]: With dead ends: 1485 [2022-07-19 14:56:11,770 INFO L226 Difference]: Without dead ends: 978 [2022-07-19 14:56:11,770 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 14:56:11,771 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:11,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 14:56:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-07-19 14:56:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2022-07-19 14:56:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.4820512820512821) internal successors, (1445), 975 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states 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 14:56:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1445 transitions. [2022-07-19 14:56:11,788 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1445 transitions. Word has length 98 [2022-07-19 14:56:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:11,788 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1445 transitions. [2022-07-19 14:56:11,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1445 transitions. [2022-07-19 14:56:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 14:56:11,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:11,790 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 14:56:11,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 14:56:11,790 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2022-07-19 14:56:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:56:11,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957847491] [2022-07-19 14:56:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:56:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 14:56:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:56:11,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957847491] [2022-07-19 14:56:11,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957847491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:11,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:11,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:56:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296233785] [2022-07-19 14:56:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:11,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:56:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:56:11,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:56:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:11,898 INFO L87 Difference]: Start difference. First operand 976 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 14:56:13,912 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 14:56:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:13,948 INFO L93 Difference]: Finished difference Result 1695 states and 2507 transitions. [2022-07-19 14:56:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:56:13,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 98 [2022-07-19 14:56:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:13,951 INFO L225 Difference]: With dead ends: 1695 [2022-07-19 14:56:13,951 INFO L226 Difference]: Without dead ends: 950 [2022-07-19 14:56:13,951 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 14:56:13,952 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:13,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 472 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 14:56:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-19 14:56:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2022-07-19 14:56:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 1.4741833508956796) internal successors, (1399), 949 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states 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 14:56:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1399 transitions. [2022-07-19 14:56:13,966 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1399 transitions. Word has length 98 [2022-07-19 14:56:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:13,966 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1399 transitions. [2022-07-19 14:56:13,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 14:56:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1399 transitions. [2022-07-19 14:56:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 14:56:13,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:13,981 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:56:13,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 14:56:13,981 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -741144714, now seen corresponding path program 1 times [2022-07-19 14:56:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:56:13,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847539177] [2022-07-19 14:56:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:56:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:56:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:56:14,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847539177] [2022-07-19 14:56:14,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847539177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:14,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:14,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:56:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351539486] [2022-07-19 14:56:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:14,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:56:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:56:14,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:56:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:56:14,090 INFO L87 Difference]: Start difference. First operand 950 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:56:16,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:56:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:16,343 INFO L93 Difference]: Finished difference Result 2150 states and 3137 transitions. [2022-07-19 14:56:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:56:16,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 101 [2022-07-19 14:56:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:16,346 INFO L225 Difference]: With dead ends: 2150 [2022-07-19 14:56:16,346 INFO L226 Difference]: Without dead ends: 1210 [2022-07-19 14:56:16,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:56:16,347 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:16,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 278 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 14:56:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-07-19 14:56:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 958. [2022-07-19 14:56:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4743991640543366) internal successors, (1411), 957 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states 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 14:56:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1411 transitions. [2022-07-19 14:56:16,362 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1411 transitions. Word has length 101 [2022-07-19 14:56:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:16,363 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1411 transitions. [2022-07-19 14:56:16,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:56:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1411 transitions. [2022-07-19 14:56:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 14:56:16,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:16,364 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2022-07-19 14:56:16,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 14:56:16,365 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-19 14:56:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:56:16,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384986668] [2022-07-19 14:56:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:56:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-19 14:56:16,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:56:16,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384986668] [2022-07-19 14:56:16,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384986668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:16,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:16,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:56:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058860760] [2022-07-19 14:56:16,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:16,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:56:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:56:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:56:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:56:16,558 INFO L87 Difference]: Start difference. First operand 958 states and 1411 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:18,571 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 14:56:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:18,705 INFO L93 Difference]: Finished difference Result 1907 states and 2808 transitions. [2022-07-19 14:56:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:56:18,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-19 14:56:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:18,708 INFO L225 Difference]: With dead ends: 1907 [2022-07-19 14:56:18,708 INFO L226 Difference]: Without dead ends: 959 [2022-07-19 14:56:18,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 14:56:18,709 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 7 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:18,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 14:56:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-19 14:56:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2022-07-19 14:56:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4733542319749215) internal successors, (1410), 957 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 14:56:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1410 transitions. [2022-07-19 14:56:18,725 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1410 transitions. Word has length 122 [2022-07-19 14:56:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:18,726 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1410 transitions. [2022-07-19 14:56:18,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1410 transitions. [2022-07-19 14:56:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-19 14:56:18,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:18,728 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:56:18,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 14:56:18,728 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-19 14:56:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:56:18,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226842192] [2022-07-19 14:56:18,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:56:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:56:19,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:56:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:56:19,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:56:19,389 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:56:19,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:56:19,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 14:56:19,396 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:56:19,399 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:56:19,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:56:19 BoogieIcfgContainer [2022-07-19 14:56:19,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:56:19,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:56:19,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:56:19,516 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:56:19,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:55:17" (3/4) ... [2022-07-19 14:56:19,518 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 14:56:19,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:56:19,518 INFO L158 Benchmark]: Toolchain (without parser) took 66107.82ms. Allocated memory was 81.8MB in the beginning and 163.6MB in the end (delta: 81.8MB). Free memory was 44.9MB in the beginning and 53.0MB in the end (delta: -8.1MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-07-19 14:56:19,519 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:56:19,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.52ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.6MB in the beginning and 56.2MB in the end (delta: -11.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-07-19 14:56:19,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.47ms. Allocated memory is still 98.6MB. Free memory was 56.2MB in the beginning and 51.2MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 14:56:19,519 INFO L158 Benchmark]: Boogie Preprocessor took 97.78ms. Allocated memory is still 98.6MB. Free memory was 51.2MB in the beginning and 44.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 14:56:19,520 INFO L158 Benchmark]: RCFGBuilder took 2955.62ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 44.4MB in the beginning and 63.7MB in the end (delta: -19.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-07-19 14:56:19,521 INFO L158 Benchmark]: TraceAbstraction took 62479.56ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 62.9MB in the beginning and 54.1MB in the end (delta: 8.9MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2022-07-19 14:56:19,522 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 163.6MB. Free memory was 54.1MB in the beginning and 53.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:56:19,528 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.52ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.6MB in the beginning and 56.2MB in the end (delta: -11.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.47ms. Allocated memory is still 98.6MB. Free memory was 56.2MB in the beginning and 51.2MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.78ms. Allocated memory is still 98.6MB. Free memory was 51.2MB in the beginning and 44.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2955.62ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 44.4MB in the beginning and 63.7MB in the end (delta: -19.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 62479.56ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 62.9MB in the beginning and 54.1MB in the end (delta: 8.9MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 163.6MB. Free memory was 54.1MB in the beginning and 53.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 1658]: 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 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:14}, s->wbio={0:-9}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967315, (s->s3)->tmp.new_cipher={-10:0}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1658] reach_error() VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.3s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 57.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1796 mSDsluCounter, 8169 SdHoareTripleChecker+Invalid, 56.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4463 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2881 IncrementalHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 3706 mSDtfsCounter, 2881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=976occurred in iteration=18, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1937 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 3445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 1288/1288 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 14:56:19,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/loops/s3.i -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 d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:56:21,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:56:21,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:56:21,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:56:21,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:56:21,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:56:21,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:56:21,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:56:21,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:56:21,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:56:21,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:56:21,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:56:21,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:56:21,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:56:21,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:56:21,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:56:21,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:56:21,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:56:21,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:56:21,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:56:21,399 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:56:21,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:56:21,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:56:21,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:56:21,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:56:21,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:56:21,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:56:21,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:56:21,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:56:21,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:56:21,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:56:21,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:56:21,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:56:21,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:56:21,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:56:21,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:56:21,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:56:21,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:56:21,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:56:21,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:56:21,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:56:21,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:56:21,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:56:21,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:56:21,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:56:21,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:56:21,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:56:21,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:56:21,443 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:56:21,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:56:21,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:56:21,444 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:56:21,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:56:21,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:56:21,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:56:21,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:56:21,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:56:21,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:56:21,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:56:21,445 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:56:21,446 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:56:21,446 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:56:21,446 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:56:21,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:56:21,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:56:21,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:56:21,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:56:21,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:56:21,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:56:21,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:56:21,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:56:21,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:56:21,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:56:21,448 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:56:21,448 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:56:21,448 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:56:21,448 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:56:21,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:56:21,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:56:21,449 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 -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-19 14:56:21,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:56:21,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:56:21,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:56:21,719 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:56:21,720 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:56:21,721 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-19 14:56:21,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a00d5ed/ab3dbd2022c041ab8c25838272e945ad/FLAG5ad9188cb [2022-07-19 14:56:22,201 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:56:22,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-19 14:56:22,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a00d5ed/ab3dbd2022c041ab8c25838272e945ad/FLAG5ad9188cb [2022-07-19 14:56:22,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a00d5ed/ab3dbd2022c041ab8c25838272e945ad [2022-07-19 14:56:22,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:56:22,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:56:22,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:56:22,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:56:22,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:56:22,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edec15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22, skipping insertion in model container [2022-07-19 14:56:22,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:56:22,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:56:22,564 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/loops/s3.i[64167,64180] [2022-07-19 14:56:22,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:56:22,588 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 14:56:22,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:56:22,689 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/loops/s3.i[64167,64180] [2022-07-19 14:56:22,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:56:22,703 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:56:22,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[64167,64180] [2022-07-19 14:56:22,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:56:22,819 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:56:22,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22 WrapperNode [2022-07-19 14:56:22,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:56:22,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:56:22,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:56:22,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:56:22,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,884 INFO L137 Inliner]: procedures = 34, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 702 [2022-07-19 14:56:22,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:56:22,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:56:22,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:56:22,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:56:22,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:56:22,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:56:22,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:56:22,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:56:22,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (1/1) ... [2022-07-19 14:56:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:56:22,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:56:22,976 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 14:56:22,994 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 14:56:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:56:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:56:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:56:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:56:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:56:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:56:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:56:23,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:56:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:56:23,143 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:56:23,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:56:23,154 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 14:56:29,353 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-19 14:56:29,353 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-19 14:56:29,353 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:56:29,361 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:56:29,361 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 14:56:29,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:56:29 BoogieIcfgContainer [2022-07-19 14:56:29,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:56:29,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:56:29,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:56:29,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:56:29,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:56:22" (1/3) ... [2022-07-19 14:56:29,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b046ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:56:29, skipping insertion in model container [2022-07-19 14:56:29,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:56:22" (2/3) ... [2022-07-19 14:56:29,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b046ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:56:29, skipping insertion in model container [2022-07-19 14:56:29,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:56:29" (3/3) ... [2022-07-19 14:56:29,370 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-19 14:56:29,380 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:56:29,381 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:56:29,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:56:29,442 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@78f70442, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42195ad [2022-07-19 14:56:29,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:56:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:56:29,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:29,453 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 14:56:29,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-19 14:56:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:56:29,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211659192] [2022-07-19 14:56:29,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:29,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:56:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:56:29,486 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 14:56:29,507 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 14:56:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:29,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:56:29,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:56:30,140 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 14:56:30,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:56:30,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:56:30,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211659192] [2022-07-19 14:56:30,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211659192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:30,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:30,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:56:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479407010] [2022-07-19 14:56:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:30,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:56:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:56:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:56:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:30,214 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:30,338 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-19 14:56:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:56:30,340 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 14:56:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:30,347 INFO L225 Difference]: With dead ends: 375 [2022-07-19 14:56:30,348 INFO L226 Difference]: Without dead ends: 217 [2022-07-19 14:56:30,350 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 14:56:30,352 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:30,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:56:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-19 14:56:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-19 14:56:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-19 14:56:30,386 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-19 14:56:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:30,387 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-19 14:56:30,387 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 14:56:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-19 14:56:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:56:30,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:30,389 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 14:56:30,404 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 14:56:30,603 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 14:56:30,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-19 14:56:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:56:30,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018723499] [2022-07-19 14:56:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:56:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:56:30,607 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 14:56:30,610 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 14:56:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:31,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:56:31,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:56:31,223 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 14:56:31,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:56:31,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:56:31,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018723499] [2022-07-19 14:56:31,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018723499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:31,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:31,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:56:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534113415] [2022-07-19 14:56:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:31,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:56:31,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:56:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:56:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:31,225 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:33,245 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 14:56:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:33,371 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-07-19 14:56:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:56:33,373 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 14:56:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:33,375 INFO L225 Difference]: With dead ends: 426 [2022-07-19 14:56:33,375 INFO L226 Difference]: Without dead ends: 319 [2022-07-19 14:56:33,375 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 14:56:33,376 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:33,376 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 14:56:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-19 14:56:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-07-19 14:56:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4779874213836477) internal successors, (470), 318 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-07-19 14:56:33,400 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-07-19 14:56:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:33,402 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-07-19 14:56:33,402 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 14:56:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-07-19 14:56:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 14:56:33,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:33,407 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 14:56:33,424 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 14:56:33,617 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 14:56:33,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-07-19 14:56:33,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:56:33,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529441206] [2022-07-19 14:56:33,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:33,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:56:33,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:56:33,620 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 14:56:33,622 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 14:56:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:34,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:56:34,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:56:34,272 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 14:56:34,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:56:34,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:56:34,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529441206] [2022-07-19 14:56:34,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529441206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:34,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:34,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:56:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895547993] [2022-07-19 14:56:34,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:56:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:56:34,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:56:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:34,274 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:36,289 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 14:56:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:36,358 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-07-19 14:56:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:56:36,358 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 14:56:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:36,360 INFO L225 Difference]: With dead ends: 632 [2022-07-19 14:56:36,360 INFO L226 Difference]: Without dead ends: 423 [2022-07-19 14:56:36,361 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 14:56:36,362 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:36,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 14:56:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-19 14:56:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-07-19 14:56:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-07-19 14:56:36,386 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-07-19 14:56:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:36,386 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-07-19 14:56:36,386 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 14:56:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-07-19 14:56:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 14:56:36,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:36,391 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 14:56:36,407 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 14:56:36,603 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 14:56:36,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-07-19 14:56:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:56:36,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485846226] [2022-07-19 14:56:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:56:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:56:36,606 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 14:56:36,655 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 14:56:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:37,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:56:37,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:56:37,288 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 14:56:37,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:56:37,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:56:37,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485846226] [2022-07-19 14:56:37,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485846226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:37,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:37,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:56:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592081947] [2022-07-19 14:56:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:37,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:56:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:56:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:56:37,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:37,289 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:39,306 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 14:56:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:39,396 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-07-19 14:56:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:56:39,397 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 14:56:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:39,399 INFO L225 Difference]: With dead ends: 839 [2022-07-19 14:56:39,399 INFO L226 Difference]: Without dead ends: 526 [2022-07-19 14:56:39,400 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 14:56:39,401 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:39,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 14:56:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-19 14:56:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-07-19 14:56:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4723809523809523) internal successors, (773), 525 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-07-19 14:56:39,423 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-07-19 14:56:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:39,424 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-07-19 14:56:39,426 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 14:56:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-07-19 14:56:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 14:56:39,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:39,428 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 14:56:39,463 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 14:56:39,645 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 14:56:39,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-07-19 14:56:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:56:39,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139495128] [2022-07-19 14:56:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:39,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:56:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:56:39,668 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 14:56:39,670 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 14:56:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:40,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:56:40,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:56:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:56:40,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:56:40,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:56:40,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139495128] [2022-07-19 14:56:40,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139495128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:40,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:40,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:56:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569684728] [2022-07-19 14:56:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:40,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:56:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:56:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:56:40,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:40,442 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:42,459 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 14:56:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:42,558 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-07-19 14:56:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:56:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-19 14:56:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:42,561 INFO L225 Difference]: With dead ends: 939 [2022-07-19 14:56:42,561 INFO L226 Difference]: Without dead ends: 523 [2022-07-19 14:56:42,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:56:42,562 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:42,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 14:56:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-19 14:56:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-19 14:56:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4616858237547892) internal successors, (763), 522 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-07-19 14:56:42,571 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-07-19 14:56:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:42,572 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-07-19 14:56:42,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-07-19 14:56:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 14:56:42,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:42,573 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:56:42,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:56:42,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:56:42,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-07-19 14:56:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:56:42,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396332760] [2022-07-19 14:56:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:42,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:56:42,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:56:42,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:56:42,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:56:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:43,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 14:56:43,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:56:44,022 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-19 14:56:44,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-19 14:56:44,248 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-19 14:56:44,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-19 14:56:44,379 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:56:44,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-19 14:56:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 14:56:44,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:56:44,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:56:44,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396332760] [2022-07-19 14:56:44,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396332760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:44,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:44,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:56:44,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11565849] [2022-07-19 14:56:44,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:44,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:56:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:56:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:56:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:56:44,413 INFO L87 Difference]: Start difference. First operand 523 states and 763 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:46,433 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 14:56:48,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:56:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:56:52,576 INFO L93 Difference]: Finished difference Result 1191 states and 1739 transitions. [2022-07-19 14:56:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:56:52,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-19 14:56:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:56:52,587 INFO L225 Difference]: With dead ends: 1191 [2022-07-19 14:56:52,587 INFO L226 Difference]: Without dead ends: 675 [2022-07-19 14:56:52,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:56:52,591 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:56:52,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 1 Unknown, 30 Unchecked, 8.1s Time] [2022-07-19 14:56:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-07-19 14:56:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 607. [2022-07-19 14:56:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.49009900990099) internal successors, (903), 606 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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 14:56:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 903 transitions. [2022-07-19 14:56:52,620 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 903 transitions. Word has length 100 [2022-07-19 14:56:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:56:52,620 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 903 transitions. [2022-07-19 14:56:52,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:56:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 903 transitions. [2022-07-19 14:56:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 14:56:52,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:56:52,622 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:56:52,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:56:52,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:56:52,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:56:52,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:56:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2022-07-19 14:56:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:56:52,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231314] [2022-07-19 14:56:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:56:52,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:56:52,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:56:52,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:56:52,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:56:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:56:54,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:56:54,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:56:54,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:56:54,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:56:54,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:56:54,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:56:54,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:56:54,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:56:54,779 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-19 14:56:54,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-19 14:56:55,525 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:56:55,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-19 14:56:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:56:55,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:56:55,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:56:55,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231314] [2022-07-19 14:56:55,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:56:55,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:56:55,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:56:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664248982] [2022-07-19 14:56:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:56:55,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:56:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:56:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:56:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:56:55,560 INFO L87 Difference]: Start difference. First operand 607 states and 903 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 14:56:57,585 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 14:56:59,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:57:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:57:07,575 INFO L93 Difference]: Finished difference Result 1413 states and 2092 transitions. [2022-07-19 14:57:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:57:07,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-19 14:57:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:57:07,589 INFO L225 Difference]: With dead ends: 1413 [2022-07-19 14:57:07,590 INFO L226 Difference]: Without dead ends: 813 [2022-07-19 14:57:07,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:57:07,591 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 46 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-19 14:57:07,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 508 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2022-07-19 14:57:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-19 14:57:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 703. [2022-07-19 14:57:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 1.5256410256410255) internal successors, (1071), 702 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states 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 14:57:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1071 transitions. [2022-07-19 14:57:07,606 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1071 transitions. Word has length 100 [2022-07-19 14:57:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:57:07,606 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1071 transitions. [2022-07-19 14:57:07,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 14:57:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1071 transitions. [2022-07-19 14:57:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 14:57:07,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:57:07,608 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:57:07,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:57:07,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:57:07,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:57:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:57:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2022-07-19 14:57:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:57:07,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737268452] [2022-07-19 14:57:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:57:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:57:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:57:07,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:57:07,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 14:57:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:57:10,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:57:10,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:57:10,708 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-19 14:57:10,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:57:10,781 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:57:10,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:57:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:57:10,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:57:10,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:57:10,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737268452] [2022-07-19 14:57:10,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737268452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:57:10,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:57:10,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:57:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473354339] [2022-07-19 14:57:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:57:10,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:57:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:57:10,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:57:10,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:57:10,839 INFO L87 Difference]: Start difference. First operand 703 states and 1071 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 14:57:12,864 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 14:57:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:57:17,335 INFO L93 Difference]: Finished difference Result 1464 states and 2226 transitions. [2022-07-19 14:57:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:57:17,338 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 115 [2022-07-19 14:57:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:57:17,341 INFO L225 Difference]: With dead ends: 1464 [2022-07-19 14:57:17,341 INFO L226 Difference]: Without dead ends: 768 [2022-07-19 14:57:17,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:57:17,342 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:57:17,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 1 Unknown, 15 Unchecked, 6.4s Time] [2022-07-19 14:57:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-07-19 14:57:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2022-07-19 14:57:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.5032594524119949) internal successors, (1153), 767 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states 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 14:57:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1153 transitions. [2022-07-19 14:57:17,364 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1153 transitions. Word has length 115 [2022-07-19 14:57:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:57:17,364 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1153 transitions. [2022-07-19 14:57:17,364 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 14:57:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1153 transitions. [2022-07-19 14:57:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 14:57:17,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:57:17,366 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:57:17,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:57:17,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:57:17,588 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:57:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:57:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2022-07-19 14:57:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:57:17,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965633580] [2022-07-19 14:57:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:57:17,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:57:17,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:57:17,591 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:57:17,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:57:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:57:19,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:57:19,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:57:20,189 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-19 14:57:20,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:57:20,290 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:57:20,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:57:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:57:20,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:57:20,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:57:20,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965633580] [2022-07-19 14:57:20,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965633580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:57:20,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:57:20,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:57:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075621463] [2022-07-19 14:57:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:57:20,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:57:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:57:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:57:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:57:20,336 INFO L87 Difference]: Start difference. First operand 768 states and 1153 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 14:57:22,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:57:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:57:26,092 INFO L93 Difference]: Finished difference Result 1534 states and 2305 transitions. [2022-07-19 14:57:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:57:26,094 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 115 [2022-07-19 14:57:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:57:26,096 INFO L225 Difference]: With dead ends: 1534 [2022-07-19 14:57:26,096 INFO L226 Difference]: Without dead ends: 773 [2022-07-19 14:57:26,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:57:26,098 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-19 14:57:26,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 1 Unknown, 18 Unchecked, 5.7s Time] [2022-07-19 14:57:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-19 14:57:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2022-07-19 14:57:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4896373056994818) internal successors, (1150), 772 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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 14:57:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1150 transitions. [2022-07-19 14:57:26,111 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1150 transitions. Word has length 115 [2022-07-19 14:57:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:57:26,112 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1150 transitions. [2022-07-19 14:57:26,112 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 14:57:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1150 transitions. [2022-07-19 14:57:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 14:57:26,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:57:26,121 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2022-07-19 14:57:26,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:57:26,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:57:26,331 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:57:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:57:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash -647023955, now seen corresponding path program 1 times [2022-07-19 14:57:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:57:26,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662564515] [2022-07-19 14:57:26,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:57:26,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:57:26,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:57:26,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:57:26,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 14:57:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:57:27,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:57:27,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:57:28,210 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-19 14:57:28,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:57:28,389 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:57:28,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:57:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:57:28,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:57:28,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:57:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662564515] [2022-07-19 14:57:28,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662564515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:57:28,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:57:28,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:57:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934241273] [2022-07-19 14:57:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:57:28,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:57:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:57:28,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:57:28,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:57:28,424 INFO L87 Difference]: Start difference. First operand 773 states and 1150 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 14:57:30,446 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 14:57:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:57:35,373 INFO L93 Difference]: Finished difference Result 1415 states and 2093 transitions. [2022-07-19 14:57:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:57:35,376 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 115 [2022-07-19 14:57:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:57:35,378 INFO L225 Difference]: With dead ends: 1415 [2022-07-19 14:57:35,378 INFO L226 Difference]: Without dead ends: 809 [2022-07-19 14:57:35,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:57:35,380 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-19 14:57:35,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 460 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 1 Unknown, 19 Unchecked, 6.9s Time] [2022-07-19 14:57:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-19 14:57:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 773. [2022-07-19 14:57:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4844559585492227) internal successors, (1146), 772 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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 14:57:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1146 transitions. [2022-07-19 14:57:35,394 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1146 transitions. Word has length 115 [2022-07-19 14:57:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:57:35,394 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1146 transitions. [2022-07-19 14:57:35,394 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 14:57:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1146 transitions. [2022-07-19 14:57:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 14:57:35,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:57:35,396 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:57:35,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:57:35,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:57:35,618 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:57:35,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:57:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2022-07-19 14:57:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:57:35,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694493895] [2022-07-19 14:57:35,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:57:35,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:57:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:57:35,621 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:57:35,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 14:57:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:57:37,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:57:37,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:57:38,431 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-19 14:57:38,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:57:38,513 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:57:38,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:57:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:57:38,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:57:38,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:57:38,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694493895] [2022-07-19 14:57:38,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694493895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:57:38,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:57:38,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:57:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923705577] [2022-07-19 14:57:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:57:38,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:57:38,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:57:38,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:57:38,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:57:38,562 INFO L87 Difference]: Start difference. First operand 773 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 14:57:40,587 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 14:57:45,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:57:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:57:45,741 INFO L93 Difference]: Finished difference Result 1544 states and 2291 transitions. [2022-07-19 14:57:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:57:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 116 [2022-07-19 14:57:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:57:45,747 INFO L225 Difference]: With dead ends: 1544 [2022-07-19 14:57:45,747 INFO L226 Difference]: Without dead ends: 778 [2022-07-19 14:57:45,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:57:45,748 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:57:45,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 81 Invalid, 1 Unknown, 17 Unchecked, 7.1s Time] [2022-07-19 14:57:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-19 14:57:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-07-19 14:57:45,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.471042471042471) internal successors, (1143), 777 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states 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 14:57:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1143 transitions. [2022-07-19 14:57:45,763 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1143 transitions. Word has length 116 [2022-07-19 14:57:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:57:45,763 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1143 transitions. [2022-07-19 14:57:45,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 14:57:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1143 transitions. [2022-07-19 14:57:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 14:57:45,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:57:45,765 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2022-07-19 14:57:45,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:57:45,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:57:45,989 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:57:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:57:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash -710278962, now seen corresponding path program 1 times [2022-07-19 14:57:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:57:45,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287822257] [2022-07-19 14:57:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:57:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:57:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:57:46,004 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:57:46,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 14:57:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:57:47,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:57:47,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:57:47,966 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-19 14:57:47,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:57:48,079 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:57:48,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:57:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:57:48,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:57:48,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:57:48,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287822257] [2022-07-19 14:57:48,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287822257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:57:48,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:57:48,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:57:48,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960610888] [2022-07-19 14:57:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:57:48,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:57:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:57:48,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:57:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:57:48,115 INFO L87 Difference]: Start difference. First operand 778 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 14:57:50,139 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 14:57:57,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:57:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:57:57,114 INFO L93 Difference]: Finished difference Result 1424 states and 2081 transitions. [2022-07-19 14:57:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:57:57,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 116 [2022-07-19 14:57:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:57:57,124 INFO L225 Difference]: With dead ends: 1424 [2022-07-19 14:57:57,124 INFO L226 Difference]: Without dead ends: 814 [2022-07-19 14:57:57,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:57:57,126 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-19 14:57:57,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 458 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 1 Unknown, 20 Unchecked, 8.9s Time] [2022-07-19 14:57:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-07-19 14:57:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 778. [2022-07-19 14:57:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.465894465894466) internal successors, (1139), 777 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 14:57:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1139 transitions. [2022-07-19 14:57:57,140 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1139 transitions. Word has length 116 [2022-07-19 14:57:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:57:57,140 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1139 transitions. [2022-07-19 14:57:57,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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 14:57:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1139 transitions. [2022-07-19 14:57:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 14:57:57,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:57:57,142 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:57:57,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-19 14:57:57,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:57:57,356 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:57:57,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:57:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2022-07-19 14:57:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:57:57,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438770598] [2022-07-19 14:57:57,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:57:57,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:57:57,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:57:57,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:57:57,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 14:57:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:57:59,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:57:59,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:57:59,616 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-19 14:57:59,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:57:59,733 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:57:59,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:57:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:57:59,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:57:59,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:57:59,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438770598] [2022-07-19 14:57:59,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438770598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:57:59,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:57:59,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:57:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336301991] [2022-07-19 14:57:59,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:57:59,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:57:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:57:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:57:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:57:59,768 INFO L87 Difference]: Start difference. First operand 778 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:01,791 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 14:58:03,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:58:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:58:05,645 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-19 14:58:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:58:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-19 14:58:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:58:05,649 INFO L225 Difference]: With dead ends: 1554 [2022-07-19 14:58:05,649 INFO L226 Difference]: Without dead ends: 783 [2022-07-19 14:58:05,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:58:05,650 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-19 14:58:05,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 1 Unknown, 19 Unchecked, 5.8s Time] [2022-07-19 14:58:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-07-19 14:58:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2022-07-19 14:58:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4526854219948848) internal successors, (1136), 782 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 14:58:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1136 transitions. [2022-07-19 14:58:05,664 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1136 transitions. Word has length 117 [2022-07-19 14:58:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:58:05,664 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1136 transitions. [2022-07-19 14:58:05,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1136 transitions. [2022-07-19 14:58:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 14:58:05,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:58:05,666 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:58:05,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-19 14:58:05,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:58:05,888 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:58:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:58:05,888 INFO L85 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2022-07-19 14:58:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:58:05,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896553789] [2022-07-19 14:58:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:58:05,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:58:05,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:58:05,890 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:58:05,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-19 14:58:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:58:07,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:58:07,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:58:08,124 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-19 14:58:08,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:58:08,221 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:58:08,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:58:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:58:08,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:58:08,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:58:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896553789] [2022-07-19 14:58:08,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896553789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:58:08,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:58:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:58:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884097960] [2022-07-19 14:58:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:58:08,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:58:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:58:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:58:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:58:08,268 INFO L87 Difference]: Start difference. First operand 783 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:10,291 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 14:58:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:58:14,178 INFO L93 Difference]: Finished difference Result 1564 states and 2271 transitions. [2022-07-19 14:58:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:58:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-19 14:58:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:58:14,183 INFO L225 Difference]: With dead ends: 1564 [2022-07-19 14:58:14,183 INFO L226 Difference]: Without dead ends: 788 [2022-07-19 14:58:14,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:58:14,184 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-19 14:58:14,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 1 Unknown, 21 Unchecked, 5.9s Time] [2022-07-19 14:58:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-19 14:58:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-19 14:58:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4396442185514613) internal successors, (1133), 787 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 14:58:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1133 transitions. [2022-07-19 14:58:14,199 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1133 transitions. Word has length 118 [2022-07-19 14:58:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:58:14,199 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1133 transitions. [2022-07-19 14:58:14,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1133 transitions. [2022-07-19 14:58:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 14:58:14,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:58:14,200 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-07-19 14:58:14,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-19 14:58:14,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:58:14,415 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:58:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:58:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2022-07-19 14:58:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:58:14,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378232737] [2022-07-19 14:58:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:58:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:58:14,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:58:14,418 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:58:14,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-19 14:58:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:58:16,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:58:16,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:58:16,835 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-19 14:58:16,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:58:16,963 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:58:16,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:58:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:58:16,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:58:16,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:58:16,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378232737] [2022-07-19 14:58:16,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378232737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:58:16,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:58:16,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:58:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072041193] [2022-07-19 14:58:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:58:16,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:58:16,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:58:16,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:58:16,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:58:16,997 INFO L87 Difference]: Start difference. First operand 788 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:19,023 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 14:58:21,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:58:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:58:24,453 INFO L93 Difference]: Finished difference Result 1569 states and 2255 transitions. [2022-07-19 14:58:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:58:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-19 14:58:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:58:24,458 INFO L225 Difference]: With dead ends: 1569 [2022-07-19 14:58:24,458 INFO L226 Difference]: Without dead ends: 788 [2022-07-19 14:58:24,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:58:24,472 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:58:24,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 18 Unchecked, 7.4s Time] [2022-07-19 14:58:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-19 14:58:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-19 14:58:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.434561626429479) internal successors, (1129), 787 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states 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 14:58:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1129 transitions. [2022-07-19 14:58:24,511 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1129 transitions. Word has length 118 [2022-07-19 14:58:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:58:24,511 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1129 transitions. [2022-07-19 14:58:24,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1129 transitions. [2022-07-19 14:58:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 14:58:24,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:58:24,528 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:58:24,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-19 14:58:24,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:58:24,744 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:58:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:58:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1781105215, now seen corresponding path program 1 times [2022-07-19 14:58:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:58:24,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854243513] [2022-07-19 14:58:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:58:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:58:24,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:58:24,747 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:58:24,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-19 14:58:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:58:26,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:58:26,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:58:27,179 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-19 14:58:27,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:58:27,320 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:58:27,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:58:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:58:27,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:58:27,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:58:27,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854243513] [2022-07-19 14:58:27,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854243513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:58:27,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:58:27,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:58:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681832556] [2022-07-19 14:58:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:58:27,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:58:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:58:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:58:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:58:27,354 INFO L87 Difference]: Start difference. First operand 788 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:29,378 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 14:58:30,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:58:34,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:58:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:58:34,630 INFO L93 Difference]: Finished difference Result 1583 states and 2264 transitions. [2022-07-19 14:58:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:58:34,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-19 14:58:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:58:34,643 INFO L225 Difference]: With dead ends: 1583 [2022-07-19 14:58:34,643 INFO L226 Difference]: Without dead ends: 802 [2022-07-19 14:58:34,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:58:34,644 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:58:34,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 1 Unknown, 22 Unchecked, 7.2s Time] [2022-07-19 14:58:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-19 14:58:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-19 14:58:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4294790343074968) internal successors, (1125), 787 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 14:58:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1125 transitions. [2022-07-19 14:58:34,658 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1125 transitions. Word has length 118 [2022-07-19 14:58:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:58:34,658 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1125 transitions. [2022-07-19 14:58:34,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1125 transitions. [2022-07-19 14:58:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-19 14:58:34,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:58:34,660 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:58:34,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-19 14:58:34,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:58:34,884 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:58:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:58:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1012937024, now seen corresponding path program 1 times [2022-07-19 14:58:34,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:58:34,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435068782] [2022-07-19 14:58:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:58:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:58:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:58:34,886 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:58:34,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-19 14:58:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:58:36,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:58:36,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:58:37,147 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-19 14:58:37,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:58:37,287 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:58:37,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:58:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:58:37,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:58:37,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:58:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435068782] [2022-07-19 14:58:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435068782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:58:37,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:58:37,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:58:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771790714] [2022-07-19 14:58:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:58:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:58:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:58:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:58:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:58:37,322 INFO L87 Difference]: Start difference. First operand 788 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:39,349 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 14:58:41,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:58:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:58:43,505 INFO L93 Difference]: Finished difference Result 1583 states and 2256 transitions. [2022-07-19 14:58:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:58:43,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-07-19 14:58:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:58:43,510 INFO L225 Difference]: With dead ends: 1583 [2022-07-19 14:58:43,510 INFO L226 Difference]: Without dead ends: 802 [2022-07-19 14:58:43,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:58:43,511 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:58:43,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 24 Unchecked, 6.1s Time] [2022-07-19 14:58:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-19 14:58:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-19 14:58:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4243964421855146) internal successors, (1121), 787 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1121 transitions. [2022-07-19 14:58:43,524 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1121 transitions. Word has length 119 [2022-07-19 14:58:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:58:43,525 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1121 transitions. [2022-07-19 14:58:43,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1121 transitions. [2022-07-19 14:58:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-19 14:58:43,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:58:43,526 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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 14:58:43,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-19 14:58:43,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:58:43,739 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:58:43,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:58:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash 405159276, now seen corresponding path program 1 times [2022-07-19 14:58:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:58:43,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185538211] [2022-07-19 14:58:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:58:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:58:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:58:43,742 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:58:43,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-19 14:58:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:58:45,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:58:45,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:58:45,928 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-19 14:58:45,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-19 14:58:46,067 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 14:58:46,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-19 14:58:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 14:58:46,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:58:46,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:58:46,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185538211] [2022-07-19 14:58:46,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185538211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:58:46,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:58:46,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:58:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082267835] [2022-07-19 14:58:46,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:58:46,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:58:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:58:46,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:58:46,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:58:46,120 INFO L87 Difference]: Start difference. First operand 788 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:48,145 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 14:58:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:58:51,816 INFO L93 Difference]: Finished difference Result 1569 states and 2231 transitions. [2022-07-19 14:58:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:58:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-07-19 14:58:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:58:51,830 INFO L225 Difference]: With dead ends: 1569 [2022-07-19 14:58:51,830 INFO L226 Difference]: Without dead ends: 788 [2022-07-19 14:58:51,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:58:51,831 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-19 14:58:51,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 1 Unknown, 18 Unchecked, 5.6s Time] [2022-07-19 14:58:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-19 14:58:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-19 14:58:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4193138500635325) internal successors, (1117), 787 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states 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 14:58:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1117 transitions. [2022-07-19 14:58:51,848 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1117 transitions. Word has length 119 [2022-07-19 14:58:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:58:51,848 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1117 transitions. [2022-07-19 14:58:51,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:58:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1117 transitions. [2022-07-19 14:58:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 14:58:51,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:58:51,850 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2022-07-19 14:58:51,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-19 14:58:52,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:58:52,067 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:58:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:58:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-19 14:58:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:58:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317060249] [2022-07-19 14:58:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:58:52,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:58:52,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:58:52,069 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:58:52,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-19 14:58:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:58:54,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 14:58:54,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:58:54,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:58:54,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:54,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-19 14:58:57,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:58:57,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:58:57,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-19 14:58:58,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:58:58,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-19 14:58:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-19 14:58:58,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:58:58,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:58:58,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317060249] [2022-07-19 14:58:58,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317060249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:58:58,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:58:58,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:58:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780001485] [2022-07-19 14:58:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:58:58,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:58:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:58:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:58:58,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:58:58,048 INFO L87 Difference]: Start difference. First operand 788 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:00,065 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 14:59:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:59:00,100 INFO L93 Difference]: Finished difference Result 1419 states and 2013 transitions. [2022-07-19 14:59:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:59:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-19 14:59:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:59:00,103 INFO L225 Difference]: With dead ends: 1419 [2022-07-19 14:59:00,103 INFO L226 Difference]: Without dead ends: 801 [2022-07-19 14:59:00,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:59:00,104 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 8 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:59:00,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.0s Time] [2022-07-19 14:59:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-07-19 14:59:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2022-07-19 14:59:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4223057644110275) internal successors, (1135), 798 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 14:59:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1135 transitions. [2022-07-19 14:59:00,127 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1135 transitions. Word has length 122 [2022-07-19 14:59:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:59:00,127 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1135 transitions. [2022-07-19 14:59:00,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1135 transitions. [2022-07-19 14:59:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 14:59:00,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:59:00,129 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-19 14:59:00,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-19 14:59:00,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:59:00,348 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:59:00,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:59:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 787843816, now seen corresponding path program 1 times [2022-07-19 14:59:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:59:00,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731992205] [2022-07-19 14:59:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:59:00,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:59:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:59:00,350 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:59:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-19 14:59:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:59:02,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 14:59:02,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:59:02,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:59:02,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:02,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:03,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-19 14:59:05,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:05,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:59:05,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-19 14:59:06,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:59:06,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-19 14:59:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-19 14:59:06,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:59:06,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:59:06,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731992205] [2022-07-19 14:59:06,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731992205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:59:06,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:59:06,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:59:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635280014] [2022-07-19 14:59:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:59:06,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:59:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:59:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:59:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:59:06,165 INFO L87 Difference]: Start difference. First operand 799 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:08,182 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 14:59:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:59:08,229 INFO L93 Difference]: Finished difference Result 1420 states and 2014 transitions. [2022-07-19 14:59:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:59:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-19 14:59:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:59:08,240 INFO L225 Difference]: With dead ends: 1420 [2022-07-19 14:59:08,240 INFO L226 Difference]: Without dead ends: 802 [2022-07-19 14:59:08,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:59:08,242 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 8 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:59:08,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 401 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.1s Time] [2022-07-19 14:59:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-19 14:59:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2022-07-19 14:59:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.4217772215269087) internal successors, (1136), 799 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 14:59:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1136 transitions. [2022-07-19 14:59:08,277 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1136 transitions. Word has length 123 [2022-07-19 14:59:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:59:08,277 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1136 transitions. [2022-07-19 14:59:08,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1136 transitions. [2022-07-19 14:59:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 14:59:08,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:59:08,280 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2022-07-19 14:59:08,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-19 14:59:08,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:59:08,484 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:59:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:59:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1698524401, now seen corresponding path program 1 times [2022-07-19 14:59:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:59:08,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474312811] [2022-07-19 14:59:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:59:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:59:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:59:08,486 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:59:08,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-19 14:59:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:59:11,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 14:59:11,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:59:11,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:59:11,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:11,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-19 14:59:14,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:14,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:59:14,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-19 14:59:14,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:59:14,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-19 14:59:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-19 14:59:14,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:59:14,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:59:14,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474312811] [2022-07-19 14:59:14,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474312811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:59:14,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:59:14,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:59:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4947249] [2022-07-19 14:59:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:59:14,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:59:14,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:59:14,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:59:14,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:59:14,816 INFO L87 Difference]: Start difference. First operand 800 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:16,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:59:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:59:18,997 INFO L93 Difference]: Finished difference Result 1428 states and 2027 transitions. [2022-07-19 14:59:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:59:18,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-19 14:59:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:59:18,999 INFO L225 Difference]: With dead ends: 1428 [2022-07-19 14:59:18,999 INFO L226 Difference]: Without dead ends: 810 [2022-07-19 14:59:18,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:59:19,000 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:59:19,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 436 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 102 Unchecked, 2.1s Time] [2022-07-19 14:59:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-19 14:59:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2022-07-19 14:59:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.4237918215613383) internal successors, (1149), 807 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states 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 14:59:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1149 transitions. [2022-07-19 14:59:19,014 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1149 transitions. Word has length 123 [2022-07-19 14:59:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:59:19,014 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1149 transitions. [2022-07-19 14:59:19,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1149 transitions. [2022-07-19 14:59:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 14:59:19,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:59:19,015 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-19 14:59:19,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-19 14:59:19,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:59:19,229 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:59:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:59:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash -935560660, now seen corresponding path program 1 times [2022-07-19 14:59:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:59:19,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723574888] [2022-07-19 14:59:19,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:59:19,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:59:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:59:19,232 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:59:19,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-19 14:59:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:59:22,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 14:59:22,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:59:22,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:59:22,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:22,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-19 14:59:24,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:59:24,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:59:24,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-19 14:59:25,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:59:25,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-19 14:59:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-19 14:59:25,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:59:25,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:59:25,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723574888] [2022-07-19 14:59:25,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723574888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:59:25,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:59:25,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:59:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943411879] [2022-07-19 14:59:25,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:59:25,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:59:25,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:59:25,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:59:25,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:59:25,655 INFO L87 Difference]: Start difference. First operand 808 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:27,679 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 14:59:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:59:27,744 INFO L93 Difference]: Finished difference Result 1429 states and 2028 transitions. [2022-07-19 14:59:27,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:59:27,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-07-19 14:59:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:59:27,754 INFO L225 Difference]: With dead ends: 1429 [2022-07-19 14:59:27,754 INFO L226 Difference]: Without dead ends: 811 [2022-07-19 14:59:27,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:59:27,756 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:59:27,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 436 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 101 Unchecked, 2.1s Time] [2022-07-19 14:59:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-07-19 14:59:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 797. [2022-07-19 14:59:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.420854271356784) internal successors, (1131), 796 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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 14:59:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1131 transitions. [2022-07-19 14:59:27,770 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1131 transitions. Word has length 124 [2022-07-19 14:59:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:59:27,770 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1131 transitions. [2022-07-19 14:59:27,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:59:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1131 transitions. [2022-07-19 14:59:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-19 14:59:27,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:59:27,772 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:59:27,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-19 14:59:27,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:59:27,980 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:59:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:59:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-19 14:59:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:59:27,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695300905] [2022-07-19 14:59:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:59:27,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:59:27,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:59:27,983 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:59:27,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-19 14:59:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:59:33,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:59:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:59:35,698 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-19 14:59:35,699 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:59:35,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:59:35,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-19 14:59:35,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:59:35,926 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:59:35,928 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:59:36,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:59:36 BoogieIcfgContainer [2022-07-19 14:59:36,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:59:36,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:59:36,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:59:36,174 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:59:36,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:56:29" (3/4) ... [2022-07-19 14:59:36,176 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 14:59:36,266 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:59:36,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:59:36,268 INFO L158 Benchmark]: Toolchain (without parser) took 194037.68ms. Allocated memory was 69.2MB in the beginning and 140.5MB in the end (delta: 71.3MB). Free memory was 47.7MB in the beginning and 37.1MB in the end (delta: 10.6MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2022-07-19 14:59:36,268 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:59:36,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.84ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 47.4MB in the beginning and 66.1MB in the end (delta: -18.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-19 14:59:36,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.24ms. Allocated memory is still 96.5MB. Free memory was 65.7MB in the beginning and 61.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:59:36,273 INFO L158 Benchmark]: Boogie Preprocessor took 51.11ms. Allocated memory is still 96.5MB. Free memory was 61.5MB in the beginning and 54.4MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 14:59:36,274 INFO L158 Benchmark]: RCFGBuilder took 6426.61ms. Allocated memory was 96.5MB in the beginning and 140.5MB in the end (delta: 44.0MB). Free memory was 54.4MB in the beginning and 74.3MB in the end (delta: -19.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-07-19 14:59:36,274 INFO L158 Benchmark]: TraceAbstraction took 186807.30ms. Allocated memory is still 140.5MB. Free memory was 73.2MB in the beginning and 55.9MB in the end (delta: 17.3MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-07-19 14:59:36,274 INFO L158 Benchmark]: Witness Printer took 92.14ms. Allocated memory is still 140.5MB. Free memory was 55.9MB in the beginning and 37.1MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 14:59:36,277 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.14ms. Allocated memory is still 69.2MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.84ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 47.4MB in the beginning and 66.1MB in the end (delta: -18.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.24ms. Allocated memory is still 96.5MB. Free memory was 65.7MB in the beginning and 61.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.11ms. Allocated memory is still 96.5MB. Free memory was 61.5MB in the beginning and 54.4MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 6426.61ms. Allocated memory was 96.5MB in the beginning and 140.5MB in the end (delta: 44.0MB). Free memory was 54.4MB in the beginning and 74.3MB in the end (delta: -19.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 186807.30ms. Allocated memory is still 140.5MB. Free memory was 73.2MB in the beginning and 55.9MB in the end (delta: 17.3MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * Witness Printer took 92.14ms. Allocated memory is still 140.5MB. Free memory was 55.9MB in the beginning and 37.1MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1658]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->info_callback={0:-2147467264}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}, tmp___1=0] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}, tmp___1=0] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1262] EXPR s->version VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->version=768, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->init_buf={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->bbio={0:-2147483648}, s->wbio={0:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1339] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147467264}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={34:0}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=9, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1658] reach_error() VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=9, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 186.5s, OverallIterations: 23, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 113.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 109.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 9805 SdHoareTripleChecker+Invalid, 107.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 614 IncrementalHoareTripleChecker+Unchecked, 5282 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1355 IncrementalHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 4523 mSDtfsCounter, 1355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2265 GetRequests, 2211 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=21, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 298 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 28.6s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 2410 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2251 ConstructedInterpolants, 56 QuantifiedInterpolants, 8185 SizeOfPredicates, 67 NumberOfNonLiveVariables, 20556 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 3098/3098 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 14:59:36,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE