./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 a31fd051 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-?-a31fd05 [2023-02-15 11:15:20,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 11:15:20,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 11:15:20,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 11:15:20,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 11:15:20,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 11:15:20,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 11:15:20,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 11:15:20,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 11:15:20,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 11:15:20,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 11:15:20,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 11:15:20,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 11:15:20,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 11:15:20,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 11:15:20,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 11:15:20,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 11:15:20,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 11:15:20,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 11:15:20,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 11:15:20,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 11:15:20,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 11:15:20,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 11:15:20,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 11:15:20,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 11:15:20,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 11:15:20,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 11:15:20,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 11:15:20,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 11:15:20,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 11:15:20,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 11:15:20,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 11:15:20,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 11:15:20,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 11:15:20,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 11:15:20,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 11:15:20,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 11:15:20,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 11:15:20,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 11:15:20,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 11:15:20,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 11:15:20,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 11:15:20,750 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 11:15:20,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 11:15:20,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 11:15:20,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 11:15:20,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 11:15:20,752 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 11:15:20,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 11:15:20,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 11:15:20,753 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 11:15:20,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 11:15:20,753 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 11:15:20,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 11:15:20,755 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 11:15:20,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 11:15:20,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 11:15:20,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 11:15:20,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 11:15:20,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:15:20,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 11:15:20,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 11:15:20,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 11:15:20,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 11:15:20,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 11:15:20,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 11:15:20,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 11:15:20,757 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 11:15:20,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 11:15:20,757 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 11:15:20,757 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-15 11:15:20,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 11:15:20,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 11:15:20,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 11:15:20,964 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 11:15:20,966 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 11:15:20,967 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 [2023-02-15 11:15:21,932 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 11:15:22,049 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 11:15:22,049 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2023-02-15 11:15:22,055 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7438735/38ac3e58c9e94549819355cfdaaa3947/FLAGdf2e3c334 [2023-02-15 11:15:22,066 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7438735/38ac3e58c9e94549819355cfdaaa3947 [2023-02-15 11:15:22,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 11:15:22,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 11:15:22,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 11:15:22,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 11:15:22,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 11:15:22,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db799e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22, skipping insertion in model container [2023-02-15 11:15:22,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 11:15:22,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 11:15:22,172 WARN L237 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] [2023-02-15 11:15:22,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:15:22,192 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 11:15:22,203 WARN L237 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] [2023-02-15 11:15:22,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:15:22,214 INFO L208 MainTranslator]: Completed translation [2023-02-15 11:15:22,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22 WrapperNode [2023-02-15 11:15:22,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 11:15:22,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 11:15:22,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 11:15:22,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 11:15:22,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,252 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2023-02-15 11:15:22,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 11:15:22,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 11:15:22,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 11:15:22,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 11:15:22,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,274 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 11:15:22,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 11:15:22,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 11:15:22,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 11:15:22,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (1/1) ... [2023-02-15 11:15:22,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:15:22,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:22,305 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) [2023-02-15 11:15:22,307 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 [2023-02-15 11:15:22,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 11:15:22,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 11:15:22,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 11:15:22,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 11:15:22,391 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 11:15:22,392 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 11:15:22,516 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 11:15:22,520 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 11:15:22,520 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 11:15:22,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:15:22 BoogieIcfgContainer [2023-02-15 11:15:22,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 11:15:22,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 11:15:22,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 11:15:22,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 11:15:22,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:15:22" (1/3) ... [2023-02-15 11:15:22,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37622b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:15:22, skipping insertion in model container [2023-02-15 11:15:22,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:15:22" (2/3) ... [2023-02-15 11:15:22,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37622b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:15:22, skipping insertion in model container [2023-02-15 11:15:22,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:15:22" (3/3) ... [2023-02-15 11:15:22,527 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2023-02-15 11:15:22,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 11:15:22,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 11:15:22,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 11:15:22,571 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50c8610a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 11:15:22,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 11:15:22,573 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) [2023-02-15 11:15:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 11:15:22,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:22,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:22,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash -493598204, now seen corresponding path program 1 times [2023-02-15 11:15:22,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:22,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057047968] [2023-02-15 11:15:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:22,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:22,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057047968] [2023-02-15 11:15:22,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057047968] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:22,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:15:22,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 11:15:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524096859] [2023-02-15 11:15:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:22,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 11:15:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:22,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 11:15:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 11:15:22,717 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) [2023-02-15 11:15:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:22,727 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2023-02-15 11:15:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 11:15:22,729 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 [2023-02-15 11:15:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:22,733 INFO L225 Difference]: With dead ends: 35 [2023-02-15 11:15:22,733 INFO L226 Difference]: Without dead ends: 17 [2023-02-15 11:15:22,735 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 [2023-02-15 11:15:22,737 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 [2023-02-15 11:15:22,738 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] [2023-02-15 11:15:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-15 11:15:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-15 11:15:22,754 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) [2023-02-15 11:15:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2023-02-15 11:15:22,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2023-02-15 11:15:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:22,756 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2023-02-15 11:15:22,756 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) [2023-02-15 11:15:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2023-02-15 11:15:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 11:15:22,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:22,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:22,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 11:15:22,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2023-02-15 11:15:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:22,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412569796] [2023-02-15 11:15:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:22,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:22,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412569796] [2023-02-15 11:15:22,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412569796] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:22,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:15:22,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:15:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610994241] [2023-02-15 11:15:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 11:15:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 11:15:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 11:15:22,851 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) [2023-02-15 11:15:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:22,882 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2023-02-15 11:15:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 11:15:22,883 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 [2023-02-15 11:15:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:22,883 INFO L225 Difference]: With dead ends: 34 [2023-02-15 11:15:22,883 INFO L226 Difference]: Without dead ends: 21 [2023-02-15 11:15:22,884 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 [2023-02-15 11:15:22,885 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:22,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:15:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-15 11:15:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2023-02-15 11:15:22,888 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) [2023-02-15 11:15:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-02-15 11:15:22,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2023-02-15 11:15:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:22,889 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-02-15 11:15:22,889 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) [2023-02-15 11:15:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-02-15 11:15:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 11:15:22,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:22,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:22,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 11:15:22,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2023-02-15 11:15:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:22,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656489211] [2023-02-15 11:15:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:15:23,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:23,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656489211] [2023-02-15 11:15:23,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656489211] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:23,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:15:23,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:15:23,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377242917] [2023-02-15 11:15:23,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:23,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:15:23,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:23,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:15:23,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:15:23,023 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) [2023-02-15 11:15:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:23,056 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2023-02-15 11:15:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:15:23,057 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 [2023-02-15 11:15:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:23,058 INFO L225 Difference]: With dead ends: 41 [2023-02-15 11:15:23,058 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 11:15:23,058 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 [2023-02-15 11:15:23,060 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 [2023-02-15 11:15:23,062 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] [2023-02-15 11:15:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 11:15:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2023-02-15 11:15:23,068 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) [2023-02-15 11:15:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2023-02-15 11:15:23,069 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2023-02-15 11:15:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:23,069 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2023-02-15 11:15:23,070 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) [2023-02-15 11:15:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2023-02-15 11:15:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 11:15:23,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:23,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:23,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 11:15:23,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2023-02-15 11:15:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:23,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475405766] [2023-02-15 11:15:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:15:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475405766] [2023-02-15 11:15:23,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475405766] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:23,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:15:23,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:15:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489431057] [2023-02-15 11:15:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:23,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 11:15:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 11:15:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 11:15:23,199 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) [2023-02-15 11:15:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:23,249 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2023-02-15 11:15:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 11:15:23,250 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 [2023-02-15 11:15:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:23,253 INFO L225 Difference]: With dead ends: 49 [2023-02-15 11:15:23,254 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 11:15:23,254 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 [2023-02-15 11:15:23,258 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:23,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:15:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 11:15:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-15 11:15:23,270 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) [2023-02-15 11:15:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-02-15 11:15:23,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2023-02-15 11:15:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:23,271 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-02-15 11:15:23,271 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) [2023-02-15 11:15:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-02-15 11:15:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 11:15:23,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:23,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:23,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 11:15:23,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2023-02-15 11:15:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:23,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854970740] [2023-02-15 11:15:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:23,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:23,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854970740] [2023-02-15 11:15:23,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854970740] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:23,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663658624] [2023-02-15 11:15:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:23,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:23,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:23,358 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) [2023-02-15 11:15:23,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 11:15:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:23,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 11:15:23,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:23,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:23,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663658624] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:23,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:23,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-02-15 11:15:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261347288] [2023-02-15 11:15:23,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:23,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 11:15:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 11:15:23,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-02-15 11:15:23,512 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) [2023-02-15 11:15:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:23,581 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2023-02-15 11:15:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 11:15:23,584 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 [2023-02-15 11:15:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:23,586 INFO L225 Difference]: With dead ends: 79 [2023-02-15 11:15:23,586 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 11:15:23,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2023-02-15 11:15:23,588 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:23,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 18 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:15:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 11:15:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-02-15 11:15:23,604 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) [2023-02-15 11:15:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2023-02-15 11:15:23,605 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2023-02-15 11:15:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:23,606 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2023-02-15 11:15:23,606 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) [2023-02-15 11:15:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2023-02-15 11:15:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 11:15:23,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:23,607 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:23,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 11:15:23,811 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 [2023-02-15 11:15:23,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash -901646477, now seen corresponding path program 2 times [2023-02-15 11:15:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:23,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900366562] [2023-02-15 11:15:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:23,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:23,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900366562] [2023-02-15 11:15:23,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900366562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:23,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312555541] [2023-02-15 11:15:23,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:15:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:23,894 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) [2023-02-15 11:15:23,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 11:15:23,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 11:15:23,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:15:23,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 11:15:23,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 11:15:23,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 11:15:24,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312555541] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:24,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:24,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-02-15 11:15:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115154684] [2023-02-15 11:15:24,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:24,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 11:15:24,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:24,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 11:15:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-02-15 11:15:24,037 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) [2023-02-15 11:15:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:24,360 INFO L93 Difference]: Finished difference Result 237 states and 337 transitions. [2023-02-15 11:15:24,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 11:15:24,360 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 [2023-02-15 11:15:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:24,361 INFO L225 Difference]: With dead ends: 237 [2023-02-15 11:15:24,361 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 11:15:24,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 11:15:24,363 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 233 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:24,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 66 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:15:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 11:15:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2023-02-15 11:15:24,375 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) [2023-02-15 11:15:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2023-02-15 11:15:24,376 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 24 [2023-02-15 11:15:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:24,376 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2023-02-15 11:15:24,376 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) [2023-02-15 11:15:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2023-02-15 11:15:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 11:15:24,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:24,377 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:24,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 11:15:24,579 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 [2023-02-15 11:15:24,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1843449907, now seen corresponding path program 1 times [2023-02-15 11:15:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:24,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417234573] [2023-02-15 11:15:24,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:24,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-02-15 11:15:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:24,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417234573] [2023-02-15 11:15:24,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417234573] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:24,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:15:24,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:15:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043563721] [2023-02-15 11:15:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:24,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:15:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:24,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:15:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:15:24,651 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) [2023-02-15 11:15:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:24,667 INFO L93 Difference]: Finished difference Result 381 states and 487 transitions. [2023-02-15 11:15:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:15:24,667 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 [2023-02-15 11:15:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:24,668 INFO L225 Difference]: With dead ends: 381 [2023-02-15 11:15:24,668 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 11:15:24,668 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 [2023-02-15 11:15:24,669 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 [2023-02-15 11:15:24,669 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] [2023-02-15 11:15:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 11:15:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2023-02-15 11:15:24,680 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) [2023-02-15 11:15:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2023-02-15 11:15:24,681 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 30 [2023-02-15 11:15:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:24,682 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2023-02-15 11:15:24,682 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) [2023-02-15 11:15:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2023-02-15 11:15:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 11:15:24,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:24,682 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:24,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 11:15:24,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 399501479, now seen corresponding path program 1 times [2023-02-15 11:15:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:24,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654824728] [2023-02-15 11:15:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:24,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654824728] [2023-02-15 11:15:24,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654824728] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:24,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143938301] [2023-02-15 11:15:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:24,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:24,763 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) [2023-02-15 11:15:24,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 11:15:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:24,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 11:15:24,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:24,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:25,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143938301] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:25,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:25,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2023-02-15 11:15:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227590998] [2023-02-15 11:15:25,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:25,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 11:15:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:25,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 11:15:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2023-02-15 11:15:25,005 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) [2023-02-15 11:15:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:25,183 INFO L93 Difference]: Finished difference Result 585 states and 801 transitions. [2023-02-15 11:15:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 11:15:25,183 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 [2023-02-15 11:15:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:25,184 INFO L225 Difference]: With dead ends: 585 [2023-02-15 11:15:25,184 INFO L226 Difference]: Without dead ends: 391 [2023-02-15 11:15:25,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2023-02-15 11:15:25,186 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:25,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 37 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:15:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-02-15 11:15:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 390. [2023-02-15 11:15:25,199 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) [2023-02-15 11:15:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 490 transitions. [2023-02-15 11:15:25,200 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 490 transitions. Word has length 31 [2023-02-15 11:15:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:25,201 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 490 transitions. [2023-02-15 11:15:25,201 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) [2023-02-15 11:15:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 490 transitions. [2023-02-15 11:15:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 11:15:25,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:25,202 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:25,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 11:15:25,406 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 [2023-02-15 11:15:25,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:25,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash -871125337, now seen corresponding path program 2 times [2023-02-15 11:15:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:25,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193223222] [2023-02-15 11:15:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:25,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193223222] [2023-02-15 11:15:25,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193223222] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:25,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256411159] [2023-02-15 11:15:25,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:15:25,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:25,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:25,624 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) [2023-02-15 11:15:25,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 11:15:25,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 11:15:25,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:15:25,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 11:15:25,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:25,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:26,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256411159] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:26,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:26,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2023-02-15 11:15:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537519733] [2023-02-15 11:15:26,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 11:15:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 11:15:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 11:15:26,112 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) [2023-02-15 11:15:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:26,293 INFO L93 Difference]: Finished difference Result 921 states and 1205 transitions. [2023-02-15 11:15:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 11:15:26,294 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 [2023-02-15 11:15:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:26,297 INFO L225 Difference]: With dead ends: 921 [2023-02-15 11:15:26,297 INFO L226 Difference]: Without dead ends: 535 [2023-02-15 11:15:26,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 11:15:26,299 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:26,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 27 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:15:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-02-15 11:15:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2023-02-15 11:15:26,325 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) [2023-02-15 11:15:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 670 transitions. [2023-02-15 11:15:26,326 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 670 transitions. Word has length 55 [2023-02-15 11:15:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:26,326 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 670 transitions. [2023-02-15 11:15:26,326 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) [2023-02-15 11:15:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 670 transitions. [2023-02-15 11:15:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-15 11:15:26,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:26,332 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:26,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 11:15:26,536 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 [2023-02-15 11:15:26,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1639992537, now seen corresponding path program 3 times [2023-02-15 11:15:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:26,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429631490] [2023-02-15 11:15:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429631490] [2023-02-15 11:15:27,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429631490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992707350] [2023-02-15 11:15:27,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 11:15:27,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:27,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:27,145 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) [2023-02-15 11:15:27,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 11:15:27,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 11:15:27,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:15:27,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 11:15:27,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2023-02-15 11:15:27,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:15:27,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992707350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:27,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 11:15:27,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [27] total 31 [2023-02-15 11:15:27,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860726181] [2023-02-15 11:15:27,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:27,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 11:15:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:27,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 11:15:27,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=631, Unknown=0, NotChecked=0, Total=930 [2023-02-15 11:15:27,385 INFO L87 Difference]: Start difference. First operand 534 states and 670 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:27,469 INFO L93 Difference]: Finished difference Result 1188 states and 1481 transitions. [2023-02-15 11:15:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 11:15:27,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 [2023-02-15 11:15:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:27,472 INFO L225 Difference]: With dead ends: 1188 [2023-02-15 11:15:27,472 INFO L226 Difference]: Without dead ends: 1186 [2023-02-15 11:15:27,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2023-02-15 11:15:27,473 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:27,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 52 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:15:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2023-02-15 11:15:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 732. [2023-02-15 11:15:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.2476060191518468) internal successors, (912), 731 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 912 transitions. [2023-02-15 11:15:27,502 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 912 transitions. Word has length 73 [2023-02-15 11:15:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:27,502 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 912 transitions. [2023-02-15 11:15:27,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 912 transitions. [2023-02-15 11:15:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-15 11:15:27,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:27,503 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:27,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 11:15:27,707 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 [2023-02-15 11:15:27,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash -336186329, now seen corresponding path program 1 times [2023-02-15 11:15:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:27,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318591286] [2023-02-15 11:15:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 11:15:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:28,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318591286] [2023-02-15 11:15:28,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318591286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:28,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:15:28,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-15 11:15:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716318766] [2023-02-15 11:15:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:28,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 11:15:28,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:28,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 11:15:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-02-15 11:15:28,004 INFO L87 Difference]: Start difference. First operand 732 states and 912 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) [2023-02-15 11:15:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:28,273 INFO L93 Difference]: Finished difference Result 3122 states and 4018 transitions. [2023-02-15 11:15:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 11:15:28,274 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 [2023-02-15 11:15:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:28,279 INFO L225 Difference]: With dead ends: 3122 [2023-02-15 11:15:28,279 INFO L226 Difference]: Without dead ends: 2671 [2023-02-15 11:15:28,280 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 [2023-02-15 11:15:28,281 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 532 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:28,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 146 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:15:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2023-02-15 11:15:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 739. [2023-02-15 11:15:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.1761517615176151) internal successors, (868), 738 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 868 transitions. [2023-02-15 11:15:28,328 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 868 transitions. Word has length 73 [2023-02-15 11:15:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:28,328 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 868 transitions. [2023-02-15 11:15:28,328 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) [2023-02-15 11:15:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 868 transitions. [2023-02-15 11:15:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-15 11:15:28,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:28,329 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:28,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 11:15:28,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:28,330 INFO L85 PathProgramCache]: Analyzing trace with hash 243663591, now seen corresponding path program 2 times [2023-02-15 11:15:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:28,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114776719] [2023-02-15 11:15:28,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:28,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114776719] [2023-02-15 11:15:28,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114776719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:28,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324697626] [2023-02-15 11:15:28,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:15:28,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:28,908 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) [2023-02-15 11:15:28,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 11:15:28,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 11:15:28,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:15:28,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 11:15:28,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:29,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:15:30,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324697626] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:30,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:30,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 75 [2023-02-15 11:15:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238282465] [2023-02-15 11:15:30,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:30,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-02-15 11:15:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-02-15 11:15:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1499, Invalid=4201, Unknown=0, NotChecked=0, Total=5700 [2023-02-15 11:15:30,865 INFO L87 Difference]: Start difference. First operand 739 states and 868 transitions. Second operand has 76 states, 76 states have (on average 2.6973684210526314) internal successors, (205), 75 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:36,724 INFO L93 Difference]: Finished difference Result 2093 states and 2470 transitions. [2023-02-15 11:15:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2023-02-15 11:15:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.6973684210526314) internal successors, (205), 75 states have internal predecessors, (205), 0 states have call successors, (0), 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 [2023-02-15 11:15:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:36,728 INFO L225 Difference]: With dead ends: 2093 [2023-02-15 11:15:36,728 INFO L226 Difference]: Without dead ends: 1697 [2023-02-15 11:15:36,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19147 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7653, Invalid=40527, Unknown=0, NotChecked=0, Total=48180 [2023-02-15 11:15:36,736 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1122 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:36,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 142 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 11:15:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2023-02-15 11:15:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1038. [2023-02-15 11:15:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.2256509161041467) internal successors, (1271), 1037 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1271 transitions. [2023-02-15 11:15:36,793 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1271 transitions. Word has length 73 [2023-02-15 11:15:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:36,793 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1271 transitions. [2023-02-15 11:15:36,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 2.6973684210526314) internal successors, (205), 75 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1271 transitions. [2023-02-15 11:15:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-15 11:15:36,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:36,794 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:36,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 11:15:36,998 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 [2023-02-15 11:15:36,999 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1623737319, now seen corresponding path program 1 times [2023-02-15 11:15:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:37,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988024977] [2023-02-15 11:15:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-02-15 11:15:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:37,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988024977] [2023-02-15 11:15:37,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988024977] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:15:37,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:15:37,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 11:15:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134795701] [2023-02-15 11:15:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:15:37,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 11:15:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 11:15:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 11:15:37,045 INFO L87 Difference]: Start difference. First operand 1038 states and 1271 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) [2023-02-15 11:15:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:37,142 INFO L93 Difference]: Finished difference Result 1734 states and 2124 transitions. [2023-02-15 11:15:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 11:15:37,142 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 [2023-02-15 11:15:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:37,146 INFO L225 Difference]: With dead ends: 1734 [2023-02-15 11:15:37,146 INFO L226 Difference]: Without dead ends: 1388 [2023-02-15 11:15:37,146 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 [2023-02-15 11:15:37,147 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:37,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:15:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2023-02-15 11:15:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1108. [2023-02-15 11:15:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.2321589882565491) internal successors, (1364), 1107 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1364 transitions. [2023-02-15 11:15:37,223 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1364 transitions. Word has length 73 [2023-02-15 11:15:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:37,223 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1364 transitions. [2023-02-15 11:15:37,223 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) [2023-02-15 11:15:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1364 transitions. [2023-02-15 11:15:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-02-15 11:15:37,227 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:37,228 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:37,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 11:15:37,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2061521628, now seen corresponding path program 1 times [2023-02-15 11:15:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:37,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588339436] [2023-02-15 11:15:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-02-15 11:15:37,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:37,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588339436] [2023-02-15 11:15:37,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588339436] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:37,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383374603] [2023-02-15 11:15:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:37,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:37,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:37,916 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) [2023-02-15 11:15:37,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 11:15:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:37,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 11:15:37,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-02-15 11:15:38,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1837 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2023-02-15 11:15:40,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383374603] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:40,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:40,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 26] total 74 [2023-02-15 11:15:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619111712] [2023-02-15 11:15:40,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:40,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-02-15 11:15:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:40,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-02-15 11:15:40,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1582, Invalid=3968, Unknown=0, NotChecked=0, Total=5550 [2023-02-15 11:15:40,140 INFO L87 Difference]: Start difference. First operand 1108 states and 1364 transitions. Second operand has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 74 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:42,661 INFO L93 Difference]: Finished difference Result 1717 states and 2090 transitions. [2023-02-15 11:15:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-02-15 11:15:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 74 states have internal predecessors, (235), 0 states have call successors, (0), 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 [2023-02-15 11:15:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:42,664 INFO L225 Difference]: With dead ends: 1717 [2023-02-15 11:15:42,664 INFO L226 Difference]: Without dead ends: 1073 [2023-02-15 11:15:42,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10311 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5777, Invalid=22953, Unknown=0, NotChecked=0, Total=28730 [2023-02-15 11:15:42,666 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 893 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:42,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 84 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 11:15:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2023-02-15 11:15:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 829. [2023-02-15 11:15:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.1920289855072463) internal successors, (987), 828 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 987 transitions. [2023-02-15 11:15:42,713 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 987 transitions. Word has length 142 [2023-02-15 11:15:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:42,713 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 987 transitions. [2023-02-15 11:15:42,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 74 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 987 transitions. [2023-02-15 11:15:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-02-15 11:15:42,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:42,714 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:42,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 11:15:42,918 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 [2023-02-15 11:15:42,919 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2032536794, now seen corresponding path program 1 times [2023-02-15 11:15:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:42,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976251986] [2023-02-15 11:15:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2023-02-15 11:15:43,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:43,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976251986] [2023-02-15 11:15:43,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976251986] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6329276] [2023-02-15 11:15:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:43,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:43,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:43,030 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) [2023-02-15 11:15:43,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 11:15:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:43,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 11:15:43,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2023-02-15 11:15:43,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2023-02-15 11:15:43,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6329276] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:43,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:43,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-02-15 11:15:43,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450981982] [2023-02-15 11:15:43,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:43,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 11:15:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:43,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 11:15:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2023-02-15 11:15:43,504 INFO L87 Difference]: Start difference. First operand 829 states and 987 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) [2023-02-15 11:15:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:43,697 INFO L93 Difference]: Finished difference Result 2539 states and 3079 transitions. [2023-02-15 11:15:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 11:15:43,697 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 [2023-02-15 11:15:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:43,700 INFO L225 Difference]: With dead ends: 2539 [2023-02-15 11:15:43,700 INFO L226 Difference]: Without dead ends: 1109 [2023-02-15 11:15:43,701 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 [2023-02-15 11:15:43,702 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 202 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:43,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 84 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:15:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-02-15 11:15:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1105. [2023-02-15 11:15:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.151268115942029) internal successors, (1271), 1104 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1271 transitions. [2023-02-15 11:15:43,759 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1271 transitions. Word has length 142 [2023-02-15 11:15:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:43,759 INFO L495 AbstractCegarLoop]: Abstraction has 1105 states and 1271 transitions. [2023-02-15 11:15:43,759 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) [2023-02-15 11:15:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1271 transitions. [2023-02-15 11:15:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2023-02-15 11:15:43,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:43,763 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:43,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 11:15:43,967 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 [2023-02-15 11:15:43,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 449680486, now seen corresponding path program 2 times [2023-02-15 11:15:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:43,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036092191] [2023-02-15 11:15:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2023-02-15 11:15:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:44,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036092191] [2023-02-15 11:15:44,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036092191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:44,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544498920] [2023-02-15 11:15:44,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:15:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:44,252 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) [2023-02-15 11:15:44,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 11:15:44,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 11:15:44,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:15:44,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 11:15:44,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2023-02-15 11:15:45,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2023-02-15 11:15:45,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544498920] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:45,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:45,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2023-02-15 11:15:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353740308] [2023-02-15 11:15:45,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:45,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 11:15:45,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:45,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 11:15:45,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2023-02-15 11:15:45,648 INFO L87 Difference]: Start difference. First operand 1105 states and 1271 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) [2023-02-15 11:15:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:45,994 INFO L93 Difference]: Finished difference Result 4179 states and 5031 transitions. [2023-02-15 11:15:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 11:15:45,995 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 [2023-02-15 11:15:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:45,998 INFO L225 Difference]: With dead ends: 4179 [2023-02-15 11:15:45,999 INFO L226 Difference]: Without dead ends: 1665 [2023-02-15 11:15:46,000 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 [2023-02-15 11:15:46,001 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 380 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:46,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 188 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:15:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2023-02-15 11:15:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1657. [2023-02-15 11:15:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.1105072463768115) internal successors, (1839), 1656 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1839 transitions. [2023-02-15 11:15:46,081 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 1839 transitions. Word has length 418 [2023-02-15 11:15:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:46,082 INFO L495 AbstractCegarLoop]: Abstraction has 1657 states and 1839 transitions. [2023-02-15 11:15:46,082 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) [2023-02-15 11:15:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 1839 transitions. [2023-02-15 11:15:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2023-02-15 11:15:46,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:46,096 INFO L195 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:46,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 11:15:46,301 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 [2023-02-15 11:15:46,301 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 133527270, now seen corresponding path program 3 times [2023-02-15 11:15:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:46,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380771477] [2023-02-15 11:15:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:15:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2023-02-15 11:15:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:15:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380771477] [2023-02-15 11:15:47,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380771477] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:15:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125705159] [2023-02-15 11:15:47,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 11:15:47,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:15:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:15:47,455 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) [2023-02-15 11:15:47,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 11:15:48,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2023-02-15 11:15:48,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:15:48,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 11:15:48,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:15:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2023-02-15 11:15:49,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:15:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2023-02-15 11:15:50,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125705159] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:15:50,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:15:50,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2023-02-15 11:15:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222036768] [2023-02-15 11:15:50,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:15:50,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 11:15:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:15:50,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 11:15:50,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 11:15:50,430 INFO L87 Difference]: Start difference. First operand 1657 states and 1839 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) [2023-02-15 11:15:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:15:50,786 INFO L93 Difference]: Finished difference Result 4049 states and 4765 transitions. [2023-02-15 11:15:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 11:15:50,786 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 [2023-02-15 11:15:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:15:50,791 INFO L225 Difference]: With dead ends: 4049 [2023-02-15 11:15:50,791 INFO L226 Difference]: Without dead ends: 2077 [2023-02-15 11:15:50,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1908 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 11:15:50,793 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 230 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:15:50,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 231 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:15:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2023-02-15 11:15:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2071. [2023-02-15 11:15:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2070 states have (on average 1.0942028985507246) internal successors, (2265), 2070 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:15:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2265 transitions. [2023-02-15 11:15:50,922 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2265 transitions. Word has length 970 [2023-02-15 11:15:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:15:50,923 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 2265 transitions. [2023-02-15 11:15:50,924 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) [2023-02-15 11:15:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2265 transitions. [2023-02-15 11:15:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2023-02-15 11:15:50,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:15:50,964 INFO L195 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:50,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 11:15:51,170 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 [2023-02-15 11:15:51,171 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:15:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:15:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash 341765318, now seen corresponding path program 4 times [2023-02-15 11:15:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:15:51,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712002801] [2023-02-15 11:15:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:15:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:15:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 11:15:51,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 11:15:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 11:15:52,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 11:15:52,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 11:15:52,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 11:15:52,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 11:15:52,067 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:15:52,071 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 11:15:52,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:15:52 BoogieIcfgContainer [2023-02-15 11:15:52,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 11:15:52,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 11:15:52,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 11:15:52,284 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 11:15:52,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:15:22" (3/4) ... [2023-02-15 11:15:52,286 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 11:15:52,506 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 11:15:52,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 11:15:52,508 INFO L158 Benchmark]: Toolchain (without parser) took 30438.53ms. Allocated memory was 161.5MB in the beginning and 645.9MB in the end (delta: 484.4MB). Free memory was 116.5MB in the beginning and 353.0MB in the end (delta: -236.6MB). Peak memory consumption was 247.5MB. Max. memory is 16.1GB. [2023-02-15 11:15:52,508 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 161.5MB. Free memory was 131.6MB in the beginning and 131.5MB in the end (delta: 101.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:15:52,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.74ms. Allocated memory is still 161.5MB. Free memory was 116.1MB in the beginning and 105.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:15:52,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.20ms. Allocated memory is still 161.5MB. Free memory was 105.6MB in the beginning and 104.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:15:52,509 INFO L158 Benchmark]: Boogie Preprocessor took 22.09ms. Allocated memory is still 161.5MB. Free memory was 104.3MB in the beginning and 103.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:15:52,509 INFO L158 Benchmark]: RCFGBuilder took 245.27ms. Allocated memory is still 161.5MB. Free memory was 103.1MB in the beginning and 92.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:15:52,509 INFO L158 Benchmark]: TraceAbstraction took 29760.98ms. Allocated memory was 161.5MB in the beginning and 645.9MB in the end (delta: 484.4MB). Free memory was 91.7MB in the beginning and 408.3MB in the end (delta: -316.6MB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. [2023-02-15 11:15:52,510 INFO L158 Benchmark]: Witness Printer took 222.76ms. Allocated memory is still 645.9MB. Free memory was 408.3MB in the beginning and 353.0MB in the end (delta: 55.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2023-02-15 11:15:52,511 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.44ms. Allocated memory is still 161.5MB. Free memory was 131.6MB in the beginning and 131.5MB in the end (delta: 101.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.74ms. Allocated memory is still 161.5MB. Free memory was 116.1MB in the beginning and 105.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.20ms. Allocated memory is still 161.5MB. Free memory was 105.6MB in the beginning and 104.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.09ms. Allocated memory is still 161.5MB. Free memory was 104.3MB in the beginning and 103.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.27ms. Allocated memory is still 161.5MB. Free memory was 103.1MB in the beginning and 92.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29760.98ms. Allocated memory was 161.5MB in the beginning and 645.9MB in the end (delta: 484.4MB). Free memory was 91.7MB in the beginning and 408.3MB in the end (delta: -316.6MB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. * Witness Printer took 222.76ms. Allocated memory is still 645.9MB. Free memory was 408.3MB in the beginning and 353.0MB in the end (delta: 55.3MB). Peak memory consumption was 54.5MB. 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: 29.5s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4077 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4077 mSDsluCounter, 1261 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 967 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3291 IncrementalHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 294 mSDtfsCounter, 3291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4279 GetRequests, 3604 SyntacticMatches, 26 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32817 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2071occurred in iteration=17, InterpolantAutomatonStates: 443, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 3641 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 5500 NumberOfCodeBlocks, 5446 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 5950 ConstructedInterpolants, 0 QuantifiedInterpolants, 39229 SizeOfPredicates, 41 NumberOfNonLiveVariables, 3398 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 42678/452362 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! [2023-02-15 11:15:52,564 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