./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:10:55,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:10:55,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:10:55,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:10:55,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:10:55,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:10:55,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:10:55,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:10:55,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:10:55,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:10:55,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:10:55,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:10:55,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:10:55,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:10:55,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:10:55,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:10:55,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:10:55,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:10:55,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:10:55,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:10:55,585 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:10:55,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:10:55,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:10:55,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:10:55,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:10:55,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:10:55,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:10:55,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:10:55,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:10:55,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:10:55,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:10:55,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:10:55,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:10:55,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:10:55,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:10:55,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:10:55,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:10:55,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:10:55,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:10:55,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:10:55,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:10:55,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:10:55,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 04:10:55,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:10:55,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:10:55,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:10:55,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:10:55,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:10:55,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:10:55,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:10:55,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:10:55,639 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:10:55,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:10:55,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:10:55,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 04:10:55,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:10:55,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:10:55,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:10:55,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:10:55,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:10:55,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:10:55,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:10:55,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:10:55,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:10:55,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:10:55,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:10:55,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:10:55,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:10:55,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:10:55,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:10:55,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:10:55,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 04:10:55,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 04:10:55,643 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:10:55,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:10:55,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:10:55,644 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 -> a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a [2022-07-12 04:10:55,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:10:55,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:10:55,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:10:55,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:10:55,920 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:10:55,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2022-07-12 04:10:55,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce820ca0a/d4687be08db34bea94aa3c704e8295bf/FLAGe7aca29f6 [2022-07-12 04:10:56,336 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:10:56,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2022-07-12 04:10:56,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce820ca0a/d4687be08db34bea94aa3c704e8295bf/FLAGe7aca29f6 [2022-07-12 04:10:56,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce820ca0a/d4687be08db34bea94aa3c704e8295bf [2022-07-12 04:10:56,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:10:56,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:10:56,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:10:56,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:10:56,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:10:56,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:56,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@caa390c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56, skipping insertion in model container [2022-07-12 04:10:56,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:56,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:10:56,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:10:56,939 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-crafted-1/nested_delay_notd2.c[468,481] [2022-07-12 04:10:56,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:10:56,959 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:10:56,975 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-crafted-1/nested_delay_notd2.c[468,481] [2022-07-12 04:10:56,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:10:56,996 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:10:56,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56 WrapperNode [2022-07-12 04:10:56,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:10:56,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:10:56,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:10:56,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:10:57,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,028 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2022-07-12 04:10:57,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:10:57,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:10:57,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:10:57,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:10:57,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:10:57,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:10:57,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:10:57,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:10:57,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (1/1) ... [2022-07-12 04:10:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:10:57,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:10:57,073 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-12 04:10:57,083 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-12 04:10:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:10:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 04:10:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:10:57,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:10:57,157 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:10:57,158 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:10:57,255 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:10:57,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:10:57,261 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 04:10:57,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:10:57 BoogieIcfgContainer [2022-07-12 04:10:57,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:10:57,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:10:57,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:10:57,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:10:57,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:10:56" (1/3) ... [2022-07-12 04:10:57,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afd4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:10:57, skipping insertion in model container [2022-07-12 04:10:57,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:10:56" (2/3) ... [2022-07-12 04:10:57,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afd4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:10:57, skipping insertion in model container [2022-07-12 04:10:57,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:10:57" (3/3) ... [2022-07-12 04:10:57,279 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2022-07-12 04:10:57,293 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:10:57,294 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:10:57,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:10:57,403 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@6ac7e0a1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27c6211a [2022-07-12 04:10:57,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:10:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 04:10:57,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:57,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:57,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash -493598204, now seen corresponding path program 1 times [2022-07-12 04:10:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:57,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116922963] [2022-07-12 04:10:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:57,579 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-12 04:10:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:57,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116922963] [2022-07-12 04:10:57,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116922963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:10:57,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:10:57,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 04:10:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062244106] [2022-07-12 04:10:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:10:57,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 04:10:57,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:57,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 04:10:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:10:57,624 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:57,648 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2022-07-12 04:10:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 04:10:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-12 04:10:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:57,658 INFO L225 Difference]: With dead ends: 35 [2022-07-12 04:10:57,659 INFO L226 Difference]: Without dead ends: 17 [2022-07-12 04:10:57,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:10:57,674 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:57,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:10:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-12 04:10:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-12 04:10:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-12 04:10:57,708 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2022-07-12 04:10:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:57,708 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-12 04:10:57,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-07-12 04:10:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 04:10:57,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:57,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:57,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 04:10:57,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2022-07-12 04:10:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:57,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292917661] [2022-07-12 04:10:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:57,843 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-12 04:10:57,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:57,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292917661] [2022-07-12 04:10:57,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292917661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:10:57,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:10:57,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:10:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061534205] [2022-07-12 04:10:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:10:57,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 04:10:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 04:10:57,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:10:57,847 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:57,899 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-07-12 04:10:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 04:10:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-12 04:10:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:57,901 INFO L225 Difference]: With dead ends: 34 [2022-07-12 04:10:57,901 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 04:10:57,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:10:57,902 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:57,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:10:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 04:10:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-07-12 04:10:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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-12 04:10:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-07-12 04:10:57,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2022-07-12 04:10:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:57,909 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-07-12 04:10:57,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-07-12 04:10:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 04:10:57,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:57,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:57,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 04:10:57,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:57,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:57,913 INFO L85 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2022-07-12 04:10:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:57,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673755351] [2022-07-12 04:10:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:57,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 04:10:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:57,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673755351] [2022-07-12 04:10:57,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673755351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:10:57,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:10:57,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:10:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53354204] [2022-07-12 04:10:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:10:57,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 04:10:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 04:10:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 04:10:57,946 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:57,988 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-07-12 04:10:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 04:10:57,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-12 04:10:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:57,990 INFO L225 Difference]: With dead ends: 41 [2022-07-12 04:10:57,990 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 04:10:57,991 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-12 04:10:57,994 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:57,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:10:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 04:10:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-07-12 04:10:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-12 04:10:58,005 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2022-07-12 04:10:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:58,006 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-12 04:10:58,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-07-12 04:10:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 04:10:58,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:58,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:58,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 04:10:58,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2022-07-12 04:10:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:58,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200438542] [2022-07-12 04:10:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 04:10:58,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:58,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200438542] [2022-07-12 04:10:58,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200438542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:10:58,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:10:58,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:10:58,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815290609] [2022-07-12 04:10:58,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:10:58,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 04:10:58,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:58,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 04:10:58,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:10:58,088 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:58,111 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-07-12 04:10:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 04:10:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-12 04:10:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:58,113 INFO L225 Difference]: With dead ends: 49 [2022-07-12 04:10:58,114 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 04:10:58,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:10:58,115 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:58,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:10:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 04:10:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-12 04:10:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-07-12 04:10:58,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2022-07-12 04:10:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:58,123 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-12 04:10:58,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-07-12 04:10:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 04:10:58,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:58,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:58,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 04:10:58,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2022-07-12 04:10:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:58,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568265321] [2022-07-12 04:10:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:10:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:58,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568265321] [2022-07-12 04:10:58,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568265321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:10:58,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444607719] [2022-07-12 04:10:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:58,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:58,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:10:58,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:10:58,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 04:10:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:58,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 04:10:58,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:10:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:10:58,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:10:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:10:58,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444607719] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:10:58,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:10:58,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-12 04:10:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805853050] [2022-07-12 04:10:58,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:10:58,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 04:10:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 04:10:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-12 04:10:58,403 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:58,493 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2022-07-12 04:10:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 04:10:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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 15 [2022-07-12 04:10:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:58,497 INFO L225 Difference]: With dead ends: 79 [2022-07-12 04:10:58,498 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 04:10:58,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-07-12 04:10:58,499 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:58,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 18 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:10:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 04:10:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-07-12 04:10:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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-12 04:10:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-07-12 04:10:58,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2022-07-12 04:10:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:58,520 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-07-12 04:10:58,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-07-12 04:10:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 04:10:58,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:58,523 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:58,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 04:10:58,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:58,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:58,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash -901646477, now seen corresponding path program 2 times [2022-07-12 04:10:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:58,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185201909] [2022-07-12 04:10:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:10:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:58,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185201909] [2022-07-12 04:10:58,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185201909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:10:58,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159785620] [2022-07-12 04:10:58,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:10:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:10:58,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:10:58,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 04:10:58,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:10:58,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:10:58,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 04:10:58,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:10:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 04:10:59,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:10:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 04:10:59,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159785620] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:10:59,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:10:59,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2022-07-12 04:10:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254435099] [2022-07-12 04:10:59,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:10:59,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 04:10:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 04:10:59,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-12 04:10:59,102 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:59,564 INFO L93 Difference]: Finished difference Result 237 states and 337 transitions. [2022-07-12 04:10:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 04:10:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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-12 04:10:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:59,566 INFO L225 Difference]: With dead ends: 237 [2022-07-12 04:10:59,566 INFO L226 Difference]: Without dead ends: 191 [2022-07-12 04:10:59,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 04:10:59,568 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 268 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:59,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 66 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 04:10:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-12 04:10:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2022-07-12 04:10:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 169 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2022-07-12 04:10:59,590 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 24 [2022-07-12 04:10:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:59,591 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2022-07-12 04:10:59,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2022-07-12 04:10:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 04:10:59,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:59,592 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:59,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 04:10:59,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 04:10:59,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1843449907, now seen corresponding path program 1 times [2022-07-12 04:10:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:59,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355813615] [2022-07-12 04:10:59,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-12 04:10:59,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355813615] [2022-07-12 04:10:59,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355813615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:10:59,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:10:59,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:10:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216977939] [2022-07-12 04:10:59,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:10:59,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 04:10:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 04:10:59,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 04:10:59,834 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:59,855 INFO L93 Difference]: Finished difference Result 381 states and 487 transitions. [2022-07-12 04:10:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 04:10:59,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 30 [2022-07-12 04:10:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:59,857 INFO L225 Difference]: With dead ends: 381 [2022-07-12 04:10:59,857 INFO L226 Difference]: Without dead ends: 215 [2022-07-12 04:10:59,861 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-12 04:10:59,862 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:59,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:10:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-12 04:10:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2022-07-12 04:10:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2022-07-12 04:10:59,891 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 30 [2022-07-12 04:10:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:59,892 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2022-07-12 04:10:59,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:10:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-07-12 04:10:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 04:10:59,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:59,893 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:59,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 04:10:59,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash 399501479, now seen corresponding path program 1 times [2022-07-12 04:10:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:59,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318438468] [2022-07-12 04:10:59,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:59,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:10:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318438468] [2022-07-12 04:10:59,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318438468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:10:59,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25677046] [2022-07-12 04:10:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:59,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:59,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:10:59,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:10:59,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 04:11:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:00,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 04:11:00,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:00,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:11:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:00,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25677046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:11:00,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:11:00,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-07-12 04:11:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216121819] [2022-07-12 04:11:00,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:11:00,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 04:11:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 04:11:00,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-07-12 04:11:00,317 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:00,560 INFO L93 Difference]: Finished difference Result 585 states and 801 transitions. [2022-07-12 04:11:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 04:11:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 04:11:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:00,563 INFO L225 Difference]: With dead ends: 585 [2022-07-12 04:11:00,563 INFO L226 Difference]: Without dead ends: 391 [2022-07-12 04:11:00,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2022-07-12 04:11:00,565 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 137 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:00,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 37 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:11:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-12 04:11:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 390. [2022-07-12 04:11:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.2596401028277635) internal successors, (490), 389 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 490 transitions. [2022-07-12 04:11:00,591 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 490 transitions. Word has length 31 [2022-07-12 04:11:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:00,591 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 490 transitions. [2022-07-12 04:11:00,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 490 transitions. [2022-07-12 04:11:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 04:11:00,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:00,593 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:00,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 04:11:00,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:00,811 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash -871125337, now seen corresponding path program 2 times [2022-07-12 04:11:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:00,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321216246] [2022-07-12 04:11:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:01,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:01,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321216246] [2022-07-12 04:11:01,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321216246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:01,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742009213] [2022-07-12 04:11:01,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:11:01,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:01,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:01,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 04:11:01,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:11:01,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:11:01,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 04:11:01,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:01,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:11:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:01,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742009213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:11:01,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:11:01,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-07-12 04:11:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594955138] [2022-07-12 04:11:01,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:11:01,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 04:11:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:01,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 04:11:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 04:11:01,664 INFO L87 Difference]: Start difference. First operand 390 states and 490 transitions. Second operand has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:01,938 INFO L93 Difference]: Finished difference Result 921 states and 1205 transitions. [2022-07-12 04:11:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 04:11:01,939 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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-12 04:11:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:01,941 INFO L225 Difference]: With dead ends: 921 [2022-07-12 04:11:01,941 INFO L226 Difference]: Without dead ends: 535 [2022-07-12 04:11:01,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 04:11:01,943 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 205 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:01,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 27 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:11:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-07-12 04:11:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2022-07-12 04:11:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.2570356472795496) internal successors, (670), 533 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 670 transitions. [2022-07-12 04:11:01,970 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 670 transitions. Word has length 55 [2022-07-12 04:11:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:01,971 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 670 transitions. [2022-07-12 04:11:01,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 670 transitions. [2022-07-12 04:11:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 04:11:01,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:01,973 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:01,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 04:11:02,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:02,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1639992537, now seen corresponding path program 3 times [2022-07-12 04:11:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:02,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067840540] [2022-07-12 04:11:02,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:02,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:02,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067840540] [2022-07-12 04:11:02,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067840540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:02,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346943197] [2022-07-12 04:11:02,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:11:02,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:02,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:02,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:02,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 04:11:03,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 04:11:03,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:11:03,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 04:11:03,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-07-12 04:11:03,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:11:03,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346943197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:11:03,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 04:11:03,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [27] total 31 [2022-07-12 04:11:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583633658] [2022-07-12 04:11:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:11:03,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 04:11:03,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:03,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 04:11:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2022-07-12 04:11:03,098 INFO L87 Difference]: Start difference. First operand 534 states and 670 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:03,187 INFO L93 Difference]: Finished difference Result 537 states and 672 transitions. [2022-07-12 04:11:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 04:11:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 73 [2022-07-12 04:11:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:03,189 INFO L225 Difference]: With dead ends: 537 [2022-07-12 04:11:03,190 INFO L226 Difference]: Without dead ends: 397 [2022-07-12 04:11:03,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 04:11:03,191 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:03,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 18 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:11:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-12 04:11:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 396. [2022-07-12 04:11:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 523 transitions. [2022-07-12 04:11:03,213 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 523 transitions. Word has length 73 [2022-07-12 04:11:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:03,213 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 523 transitions. [2022-07-12 04:11:03,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-07-12 04:11:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 04:11:03,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:03,215 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:03,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 04:11:03,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 04:11:03,431 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:03,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash -336186329, now seen corresponding path program 1 times [2022-07-12 04:11:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:03,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163520123] [2022-07-12 04:11:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 04:11:03,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:03,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163520123] [2022-07-12 04:11:03,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163520123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:11:03,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:11:03,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-12 04:11:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678229662] [2022-07-12 04:11:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:11:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 04:11:03,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:03,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 04:11:03,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-07-12 04:11:03,784 INFO L87 Difference]: Start difference. First operand 396 states and 523 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:04,141 INFO L93 Difference]: Finished difference Result 1984 states and 2611 transitions. [2022-07-12 04:11:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 04:11:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 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 73 [2022-07-12 04:11:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:04,148 INFO L225 Difference]: With dead ends: 1984 [2022-07-12 04:11:04,149 INFO L226 Difference]: Without dead ends: 1730 [2022-07-12 04:11:04,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-07-12 04:11:04,150 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 675 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:04,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 142 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 04:11:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-07-12 04:11:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 400. [2022-07-12 04:11:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.2355889724310778) internal successors, (493), 399 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2022-07-12 04:11:04,190 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 73 [2022-07-12 04:11:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:04,190 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2022-07-12 04:11:04,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2022-07-12 04:11:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 04:11:04,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:04,192 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:04,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 04:11:04,193 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1438821033, now seen corresponding path program 1 times [2022-07-12 04:11:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:04,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381637086] [2022-07-12 04:11:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:04,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:04,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381637086] [2022-07-12 04:11:04,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381637086] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:04,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628978679] [2022-07-12 04:11:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:04,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:04,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:04,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:04,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 04:11:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:04,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 04:11:04,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:05,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:11:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:07,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628978679] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:11:07,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:11:07,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2022-07-12 04:11:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130358608] [2022-07-12 04:11:07,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:11:07,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-07-12 04:11:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-07-12 04:11:07,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1574, Invalid=3828, Unknown=0, NotChecked=0, Total=5402 [2022-07-12 04:11:07,494 INFO L87 Difference]: Start difference. First operand 400 states and 493 transitions. Second operand has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:11,261 INFO L93 Difference]: Finished difference Result 1254 states and 1559 transitions. [2022-07-12 04:11:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-07-12 04:11:11,262 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 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 73 [2022-07-12 04:11:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:11,266 INFO L225 Difference]: With dead ends: 1254 [2022-07-12 04:11:11,267 INFO L226 Difference]: Without dead ends: 1252 [2022-07-12 04:11:11,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8218 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4191, Invalid=17565, Unknown=0, NotChecked=0, Total=21756 [2022-07-12 04:11:11,272 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 636 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:11,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 115 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 04:11:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-07-12 04:11:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 765. [2022-07-12 04:11:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.2382198952879582) internal successors, (946), 764 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 946 transitions. [2022-07-12 04:11:11,363 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 946 transitions. Word has length 73 [2022-07-12 04:11:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:11,363 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 946 transitions. [2022-07-12 04:11:11,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 946 transitions. [2022-07-12 04:11:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 04:11:11,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:11,365 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:11,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 04:11:11,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:11,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1623737319, now seen corresponding path program 1 times [2022-07-12 04:11:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:11,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86363028] [2022-07-12 04:11:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-07-12 04:11:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:11,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86363028] [2022-07-12 04:11:11,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86363028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:11:11,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:11:11,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 04:11:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030216202] [2022-07-12 04:11:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:11:11,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 04:11:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:11,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 04:11:11,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 04:11:11,665 INFO L87 Difference]: Start difference. First operand 765 states and 946 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:11,759 INFO L93 Difference]: Finished difference Result 1189 states and 1473 transitions. [2022-07-12 04:11:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 04:11:11,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 73 [2022-07-12 04:11:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:11,763 INFO L225 Difference]: With dead ends: 1189 [2022-07-12 04:11:11,763 INFO L226 Difference]: Without dead ends: 990 [2022-07-12 04:11:11,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 04:11:11,764 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 88 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:11,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:11:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-07-12 04:11:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 843. [2022-07-12 04:11:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.2458432304038005) internal successors, (1049), 842 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1049 transitions. [2022-07-12 04:11:11,851 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1049 transitions. Word has length 73 [2022-07-12 04:11:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:11,852 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1049 transitions. [2022-07-12 04:11:11,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1049 transitions. [2022-07-12 04:11:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 04:11:11,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:11,853 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:11,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 04:11:11,854 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2032536794, now seen corresponding path program 1 times [2022-07-12 04:11:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:11,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498098312] [2022-07-12 04:11:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-07-12 04:11:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:11,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498098312] [2022-07-12 04:11:11,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498098312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:11,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541855299] [2022-07-12 04:11:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:11,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:11,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:11,930 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:11,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 04:11:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:11,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 04:11:12,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-07-12 04:11:12,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:11:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-07-12 04:11:12,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541855299] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:11:12,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:11:12,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-07-12 04:11:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341217627] [2022-07-12 04:11:12,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:11:12,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 04:11:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 04:11:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2022-07-12 04:11:12,483 INFO L87 Difference]: Start difference. First operand 843 states and 1049 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:12,724 INFO L93 Difference]: Finished difference Result 2081 states and 2589 transitions. [2022-07-12 04:11:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 04:11:12,724 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2022-07-12 04:11:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:12,731 INFO L225 Difference]: With dead ends: 2081 [2022-07-12 04:11:12,731 INFO L226 Difference]: Without dead ends: 1882 [2022-07-12 04:11:12,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2022-07-12 04:11:12,733 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 325 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:12,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 97 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:11:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-12 04:11:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1155. [2022-07-12 04:11:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2660311958405546) internal successors, (1461), 1154 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1461 transitions. [2022-07-12 04:11:12,862 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1461 transitions. Word has length 142 [2022-07-12 04:11:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:12,863 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1461 transitions. [2022-07-12 04:11:12,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1461 transitions. [2022-07-12 04:11:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 04:11:12,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:12,867 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 39, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:12,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 04:11:13,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:13,084 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1816689998, now seen corresponding path program 1 times [2022-07-12 04:11:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:13,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494326135] [2022-07-12 04:11:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 721 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-07-12 04:11:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494326135] [2022-07-12 04:11:13,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494326135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960485156] [2022-07-12 04:11:13,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:13,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:13,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:13,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 04:11:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:13,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 04:11:13,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1959 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-07-12 04:11:14,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:11:14,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960485156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:11:14,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 04:11:14,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 44 [2022-07-12 04:11:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637151453] [2022-07-12 04:11:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:11:14,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 04:11:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 04:11:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 04:11:14,140 INFO L87 Difference]: Start difference. First operand 1155 states and 1461 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:14,401 INFO L93 Difference]: Finished difference Result 2101 states and 2653 transitions. [2022-07-12 04:11:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 04:11:14,403 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 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 145 [2022-07-12 04:11:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:14,407 INFO L225 Difference]: With dead ends: 2101 [2022-07-12 04:11:14,413 INFO L226 Difference]: Without dead ends: 876 [2022-07-12 04:11:14,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 04:11:14,417 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:14,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 04:11:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-07-12 04:11:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 810. [2022-07-12 04:11:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 1.1137206427688504) internal successors, (901), 809 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 901 transitions. [2022-07-12 04:11:14,521 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 901 transitions. Word has length 145 [2022-07-12 04:11:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:14,521 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 901 transitions. [2022-07-12 04:11:14,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 901 transitions. [2022-07-12 04:11:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-07-12 04:11:14,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:14,528 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:14,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 04:11:14,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 04:11:14,755 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash 449680486, now seen corresponding path program 2 times [2022-07-12 04:11:14,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:14,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097833718] [2022-07-12 04:11:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-07-12 04:11:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:14,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097833718] [2022-07-12 04:11:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097833718] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181322048] [2022-07-12 04:11:14,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:11:14,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:14,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:14,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 04:11:15,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:11:15,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:11:15,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 04:11:15,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-07-12 04:11:16,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:11:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-07-12 04:11:16,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181322048] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:11:16,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:11:16,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-07-12 04:11:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17186956] [2022-07-12 04:11:16,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:11:16,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 04:11:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:16,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 04:11:16,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-07-12 04:11:16,778 INFO L87 Difference]: Start difference. First operand 810 states and 901 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:17,123 INFO L93 Difference]: Finished difference Result 2567 states and 3037 transitions. [2022-07-12 04:11:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 04:11:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 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 418 [2022-07-12 04:11:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:17,131 INFO L225 Difference]: With dead ends: 2567 [2022-07-12 04:11:17,131 INFO L226 Difference]: Without dead ends: 1362 [2022-07-12 04:11:17,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2022-07-12 04:11:17,133 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 464 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:17,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 174 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:11:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-07-12 04:11:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2022-07-12 04:11:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 1.073475385745775) internal successors, (1461), 1361 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1461 transitions. [2022-07-12 04:11:17,260 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1461 transitions. Word has length 418 [2022-07-12 04:11:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:17,262 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1461 transitions. [2022-07-12 04:11:17,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1461 transitions. [2022-07-12 04:11:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2022-07-12 04:11:17,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:17,290 INFO L195 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:17,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 04:11:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 04:11:17,503 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 133527270, now seen corresponding path program 3 times [2022-07-12 04:11:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199780662] [2022-07-12 04:11:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-07-12 04:11:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199780662] [2022-07-12 04:11:18,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199780662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266964708] [2022-07-12 04:11:18,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:11:18,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:18,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:18,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:18,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 04:11:18,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2022-07-12 04:11:18,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:11:18,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 04:11:18,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-07-12 04:11:21,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:11:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-07-12 04:11:22,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266964708] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:11:22,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:11:22,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-07-12 04:11:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427074348] [2022-07-12 04:11:22,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:11:22,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 04:11:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 04:11:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 04:11:22,310 INFO L87 Difference]: Start difference. First operand 1362 states and 1461 transitions. Second operand has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:22,700 INFO L93 Difference]: Finished difference Result 2729 states and 3123 transitions. [2022-07-12 04:11:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 04:11:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 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 970 [2022-07-12 04:11:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:22,707 INFO L225 Difference]: With dead ends: 2729 [2022-07-12 04:11:22,707 INFO L226 Difference]: Without dead ends: 1776 [2022-07-12 04:11:22,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1917 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 04:11:22,709 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 825 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:22,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 232 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:11:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2022-07-12 04:11:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2022-07-12 04:11:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.059718309859155) internal successors, (1881), 1775 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1881 transitions. [2022-07-12 04:11:22,860 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1881 transitions. Word has length 970 [2022-07-12 04:11:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:22,861 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 1881 transitions. [2022-07-12 04:11:22,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1881 transitions. [2022-07-12 04:11:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2022-07-12 04:11:22,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:22,876 INFO L195 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:22,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 04:11:23,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 04:11:23,097 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 341765318, now seen corresponding path program 4 times [2022-07-12 04:11:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320798480] [2022-07-12 04:11:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:11:23,619 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 04:11:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:11:24,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 04:11:24,303 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 04:11:24,304 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 04:11:24,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 04:11:24,310 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:24,315 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 04:11:24,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 04:11:24 BoogieIcfgContainer [2022-07-12 04:11:24,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 04:11:24,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 04:11:24,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 04:11:24,649 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 04:11:24,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:10:57" (3/4) ... [2022-07-12 04:11:24,651 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 04:11:24,959 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 04:11:24,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 04:11:24,960 INFO L158 Benchmark]: Toolchain (without parser) took 28185.79ms. Allocated memory was 96.5MB in the beginning and 413.1MB in the end (delta: 316.7MB). Free memory was 65.2MB in the beginning and 224.5MB in the end (delta: -159.3MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. [2022-07-12 04:11:24,961 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 52.3MB in the beginning and 52.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:11:24,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.89ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 65.0MB in the beginning and 92.7MB in the end (delta: -27.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:11:24,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.46ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 91.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:11:24,962 INFO L158 Benchmark]: Boogie Preprocessor took 16.50ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 971.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:11:24,962 INFO L158 Benchmark]: RCFGBuilder took 216.42ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 80.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:11:24,963 INFO L158 Benchmark]: TraceAbstraction took 27383.15ms. Allocated memory was 117.4MB in the beginning and 413.1MB in the end (delta: 295.7MB). Free memory was 80.0MB in the beginning and 284.3MB in the end (delta: -204.3MB). Peak memory consumption was 183.7MB. Max. memory is 16.1GB. [2022-07-12 04:11:24,963 INFO L158 Benchmark]: Witness Printer took 311.30ms. Allocated memory is still 413.1MB. Free memory was 284.3MB in the beginning and 224.5MB in the end (delta: 59.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-07-12 04:11:24,967 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 52.3MB in the beginning and 52.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.89ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 65.0MB in the beginning and 92.7MB in the end (delta: -27.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.46ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 91.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.50ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 971.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 216.42ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 80.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27383.15ms. Allocated memory was 117.4MB in the beginning and 413.1MB in the end (delta: 295.7MB). Free memory was 80.0MB in the beginning and 284.3MB in the end (delta: -204.3MB). Peak memory consumption was 183.7MB. Max. memory is 16.1GB. * Witness Printer took 311.30ms. Allocated memory is still 413.1MB. Free memory was 284.3MB in the beginning and 224.5MB in the end (delta: 59.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) [L6] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L21] RET assume_abort_if_not(last > 0) [L22] int a=0,b=0,c=0,st=0,d=0; VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=20, d=0, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=40, b=40, c=20, d=20, last=21, SIZE=20, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [a=0, b=1, c=20, d=20, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, last=21, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, cond=0, last=21, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.0s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3861 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3861 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 849 mSDsCounter, 548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2342 IncrementalHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 548 mSolverCounterUnsat, 278 mSDtfsCounter, 2342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3971 GetRequests, 3513 SyntacticMatches, 5 SemanticMatches, 453 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11148 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1776occurred in iteration=17, InterpolantAutomatonStates: 296, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 2812 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 5506 NumberOfCodeBlocks, 5452 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 5815 ConstructedInterpolants, 0 QuantifiedInterpolants, 34277 SizeOfPredicates, 29 NumberOfNonLiveVariables, 3433 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 44769/450178 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-12 04:11:25,031 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE