./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/systemc/pc_sfifo_2.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:12:17,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:12:17,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:12:17,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:12:17,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:12:17,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:12:17,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:12:17,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:12:17,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:12:17,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:12:17,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:12:17,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:12:17,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:12:17,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:12:17,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:12:17,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:12:17,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:12:17,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:12:17,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:12:17,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:12:17,446 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:12:17,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:12:17,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:12:17,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:12:17,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:12:17,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:12:17,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:12:17,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:12:17,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:12:17,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:12:17,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:12:17,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:12:17,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:12:17,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:12:17,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:12:17,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:12:17,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:12:17,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:12:17,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:12:17,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:12:17,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:12:17,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:12:17,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:12:17,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:12:17,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:12:17,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:12:17,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:12:17,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:12:17,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:12:17,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:12:17,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:12:17,520 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:12:17,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:12:17,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:12:17,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:12:17,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:12:17,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:12:17,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:12:17,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:12:17,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:12:17,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:12:17,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:12:17,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:12:17,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:12:17,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:12:17,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:12:17,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:12:17,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:17,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:12:17,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:12:17,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:12:17,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:12:17,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:12:17,524 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:12:17,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:12:17,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:12:17,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2022-07-13 18:12:17,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:12:17,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:12:17,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:12:17,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:12:17,889 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:12:17,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-07-13 18:12:17,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ababc1d/31714c684872482891c10e62926fcc3a/FLAGc6524cc17 [2022-07-13 18:12:18,503 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:12:18,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-07-13 18:12:18,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ababc1d/31714c684872482891c10e62926fcc3a/FLAGc6524cc17 [2022-07-13 18:12:18,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ababc1d/31714c684872482891c10e62926fcc3a [2022-07-13 18:12:18,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:12:18,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:12:18,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:18,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:12:18,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:12:18,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:18" (1/1) ... [2022-07-13 18:12:18,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3c5e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:18, skipping insertion in model container [2022-07-13 18:12:18,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:18" (1/1) ... [2022-07-13 18:12:18,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:12:18,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:12:19,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-07-13 18:12:19,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:19,267 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:12:19,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-07-13 18:12:19,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:19,344 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:12:19,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19 WrapperNode [2022-07-13 18:12:19,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:19,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:19,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:12:19,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:12:19,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,425 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2022-07-13 18:12:19,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:19,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:12:19,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:12:19,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:12:19,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:12:19,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:12:19,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:12:19,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:12:19,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (1/1) ... [2022-07-13 18:12:19,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:19,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:12:19,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:12:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:12:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-13 18:12:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-13 18:12:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 18:12:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 18:12:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-13 18:12:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-13 18:12:19,566 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-13 18:12:19,576 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-13 18:12:19,578 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-13 18:12:19,578 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-13 18:12:19,578 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-13 18:12:19,579 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-13 18:12:19,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:12:19,579 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-13 18:12:19,579 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-13 18:12:19,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:12:19,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:12:19,579 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 18:12:19,580 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 18:12:19,671 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:12:19,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:12:20,041 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:12:20,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:12:20,071 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 18:12:20,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:20 BoogieIcfgContainer [2022-07-13 18:12:20,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:12:20,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:12:20,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:12:20,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:12:20,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:12:18" (1/3) ... [2022-07-13 18:12:20,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e3d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:20, skipping insertion in model container [2022-07-13 18:12:20,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:19" (2/3) ... [2022-07-13 18:12:20,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e3d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:20, skipping insertion in model container [2022-07-13 18:12:20,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:20" (3/3) ... [2022-07-13 18:12:20,092 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2022-07-13 18:12:20,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:12:20,112 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:12:20,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:12:20,188 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@121439d4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6587bfae [2022-07-13 18:12:20,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:12:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-13 18:12:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:20,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:20,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:20,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2022-07-13 18:12:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:20,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318103423] [2022-07-13 18:12:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:20,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318103423] [2022-07-13 18:12:20,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318103423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:20,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:20,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:12:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101935755] [2022-07-13 18:12:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:20,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:12:20,748 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:21,165 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2022-07-13 18:12:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:12:21,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-13 18:12:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:21,177 INFO L225 Difference]: With dead ends: 215 [2022-07-13 18:12:21,189 INFO L226 Difference]: Without dead ends: 115 [2022-07-13 18:12:21,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:12:21,197 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 209 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:21,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 289 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:12:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-13 18:12:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2022-07-13 18:12:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-13 18:12:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2022-07-13 18:12:21,293 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2022-07-13 18:12:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:21,293 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2022-07-13 18:12:21,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-07-13 18:12:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:21,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:21,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:21,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:12:21,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2022-07-13 18:12:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:21,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963098466] [2022-07-13 18:12:21,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:21,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963098466] [2022-07-13 18:12:21,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963098466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:21,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:21,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:12:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68309768] [2022-07-13 18:12:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:21,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:12:21,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:21,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:12:21,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:21,576 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:22,191 INFO L93 Difference]: Finished difference Result 320 states and 445 transitions. [2022-07-13 18:12:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 18:12:22,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-13 18:12:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:22,214 INFO L225 Difference]: With dead ends: 320 [2022-07-13 18:12:22,215 INFO L226 Difference]: Without dead ends: 232 [2022-07-13 18:12:22,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:12:22,221 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 399 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:22,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 403 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:12:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-13 18:12:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2022-07-13 18:12:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-07-13 18:12:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2022-07-13 18:12:22,292 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2022-07-13 18:12:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:22,292 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2022-07-13 18:12:22,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2022-07-13 18:12:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:22,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:22,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:22,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:12:22,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2022-07-13 18:12:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:22,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834855712] [2022-07-13 18:12:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834855712] [2022-07-13 18:12:22,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834855712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:22,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:22,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:12:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883090219] [2022-07-13 18:12:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:22,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:12:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:12:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:22,505 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:23,214 INFO L93 Difference]: Finished difference Result 540 states and 738 transitions. [2022-07-13 18:12:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:12:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-13 18:12:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:23,219 INFO L225 Difference]: With dead ends: 540 [2022-07-13 18:12:23,220 INFO L226 Difference]: Without dead ends: 363 [2022-07-13 18:12:23,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-13 18:12:23,226 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 446 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:23,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 643 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:12:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-13 18:12:23,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2022-07-13 18:12:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-07-13 18:12:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2022-07-13 18:12:23,274 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2022-07-13 18:12:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:23,275 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2022-07-13 18:12:23,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2022-07-13 18:12:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:23,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:23,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:23,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:12:23,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2022-07-13 18:12:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:23,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912358038] [2022-07-13 18:12:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:23,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:23,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912358038] [2022-07-13 18:12:23,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912358038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:23,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:23,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:12:23,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426222210] [2022-07-13 18:12:23,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:23,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:12:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:12:23,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:23,505 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:12:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:23,935 INFO L93 Difference]: Finished difference Result 590 states and 809 transitions. [2022-07-13 18:12:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 18:12:23,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2022-07-13 18:12:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:23,939 INFO L225 Difference]: With dead ends: 590 [2022-07-13 18:12:23,939 INFO L226 Difference]: Without dead ends: 323 [2022-07-13 18:12:23,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:12:23,944 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 114 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:23,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 528 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-13 18:12:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2022-07-13 18:12:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-07-13 18:12:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2022-07-13 18:12:23,986 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2022-07-13 18:12:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:23,986 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2022-07-13 18:12:23,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:12:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2022-07-13 18:12:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:23,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:23,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:23,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:12:23,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2022-07-13 18:12:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:23,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032756423] [2022-07-13 18:12:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:24,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:24,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032756423] [2022-07-13 18:12:24,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032756423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:24,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:24,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:12:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520143171] [2022-07-13 18:12:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:24,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:12:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:12:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:24,143 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 18:12:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:25,243 INFO L93 Difference]: Finished difference Result 1956 states and 2670 transitions. [2022-07-13 18:12:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 18:12:25,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-07-13 18:12:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:25,249 INFO L225 Difference]: With dead ends: 1956 [2022-07-13 18:12:25,249 INFO L226 Difference]: Without dead ends: 1684 [2022-07-13 18:12:25,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 18:12:25,251 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 1150 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:25,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 864 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 18:12:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-07-13 18:12:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1434. [2022-07-13 18:12:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-07-13 18:12:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1882 transitions. [2022-07-13 18:12:25,314 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1882 transitions. Word has length 64 [2022-07-13 18:12:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:25,315 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1882 transitions. [2022-07-13 18:12:25,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 18:12:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1882 transitions. [2022-07-13 18:12:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:25,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:25,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:25,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:12:25,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2022-07-13 18:12:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:25,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877660382] [2022-07-13 18:12:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:25,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:25,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877660382] [2022-07-13 18:12:25,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877660382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:25,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:25,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:12:25,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645302349] [2022-07-13 18:12:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:25,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:12:25,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:12:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:25,402 INFO L87 Difference]: Start difference. First operand 1434 states and 1882 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:12:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:25,826 INFO L93 Difference]: Finished difference Result 3035 states and 4006 transitions. [2022-07-13 18:12:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:12:25,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2022-07-13 18:12:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:25,833 INFO L225 Difference]: With dead ends: 3035 [2022-07-13 18:12:25,845 INFO L226 Difference]: Without dead ends: 1623 [2022-07-13 18:12:25,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:12:25,849 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 112 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:25,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 526 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:12:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-07-13 18:12:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1479. [2022-07-13 18:12:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-07-13 18:12:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1921 transitions. [2022-07-13 18:12:26,002 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1921 transitions. Word has length 64 [2022-07-13 18:12:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:26,003 INFO L495 AbstractCegarLoop]: Abstraction has 1479 states and 1921 transitions. [2022-07-13 18:12:26,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:12:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1921 transitions. [2022-07-13 18:12:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:26,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:26,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:26,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:12:26,004 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2022-07-13 18:12:26,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:26,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954485063] [2022-07-13 18:12:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:26,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954485063] [2022-07-13 18:12:26,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954485063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:26,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:26,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:12:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190679229] [2022-07-13 18:12:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:26,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:12:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:12:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:26,135 INFO L87 Difference]: Start difference. First operand 1479 states and 1921 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:26,759 INFO L93 Difference]: Finished difference Result 2914 states and 3760 transitions. [2022-07-13 18:12:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:12:26,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-13 18:12:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:26,767 INFO L225 Difference]: With dead ends: 2914 [2022-07-13 18:12:26,767 INFO L226 Difference]: Without dead ends: 1677 [2022-07-13 18:12:26,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-13 18:12:26,788 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 332 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:26,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 469 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:12:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-07-13 18:12:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1457. [2022-07-13 18:12:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-07-13 18:12:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1881 transitions. [2022-07-13 18:12:26,898 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1881 transitions. Word has length 64 [2022-07-13 18:12:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:26,898 INFO L495 AbstractCegarLoop]: Abstraction has 1457 states and 1881 transitions. [2022-07-13 18:12:26,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1881 transitions. [2022-07-13 18:12:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:26,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:26,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:26,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 18:12:26,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:26,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2022-07-13 18:12:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:26,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820100290] [2022-07-13 18:12:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:27,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:27,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820100290] [2022-07-13 18:12:27,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820100290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:27,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:27,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:12:27,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105664903] [2022-07-13 18:12:27,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:27,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:12:27,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:27,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:12:27,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:27,003 INFO L87 Difference]: Start difference. First operand 1457 states and 1881 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:27,551 INFO L93 Difference]: Finished difference Result 4532 states and 5857 transitions. [2022-07-13 18:12:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:12:27,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-13 18:12:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:27,578 INFO L225 Difference]: With dead ends: 4532 [2022-07-13 18:12:27,579 INFO L226 Difference]: Without dead ends: 3100 [2022-07-13 18:12:27,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:12:27,582 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 295 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:27,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 377 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-07-13 18:12:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2828. [2022-07-13 18:12:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2022-07-13 18:12:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3619 transitions. [2022-07-13 18:12:27,818 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3619 transitions. Word has length 64 [2022-07-13 18:12:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:27,818 INFO L495 AbstractCegarLoop]: Abstraction has 2828 states and 3619 transitions. [2022-07-13 18:12:27,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3619 transitions. [2022-07-13 18:12:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 18:12:27,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:27,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:27,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:12:27,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2022-07-13 18:12:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:27,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531941209] [2022-07-13 18:12:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:27,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:27,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531941209] [2022-07-13 18:12:27,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531941209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:27,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:27,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:12:27,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529209419] [2022-07-13 18:12:27,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:27,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:12:27,900 INFO L87 Difference]: Start difference. First operand 2828 states and 3619 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:12:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:28,445 INFO L93 Difference]: Finished difference Result 7846 states and 10129 transitions. [2022-07-13 18:12:28,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:12:28,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-13 18:12:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:28,487 INFO L225 Difference]: With dead ends: 7846 [2022-07-13 18:12:28,499 INFO L226 Difference]: Without dead ends: 5022 [2022-07-13 18:12:28,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:28,510 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:28,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 285 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2022-07-13 18:12:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4506. [2022-07-13 18:12:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2022-07-13 18:12:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5736 transitions. [2022-07-13 18:12:28,928 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5736 transitions. Word has length 65 [2022-07-13 18:12:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:28,928 INFO L495 AbstractCegarLoop]: Abstraction has 4506 states and 5736 transitions. [2022-07-13 18:12:28,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:12:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5736 transitions. [2022-07-13 18:12:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:12:28,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:28,931 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:28,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 18:12:28,931 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2022-07-13 18:12:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:28,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783118964] [2022-07-13 18:12:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:29,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783118964] [2022-07-13 18:12:29,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783118964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:29,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:29,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:12:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303088860] [2022-07-13 18:12:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:29,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:12:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:12:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:29,010 INFO L87 Difference]: Start difference. First operand 4506 states and 5736 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:12:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:29,631 INFO L93 Difference]: Finished difference Result 6136 states and 7738 transitions. [2022-07-13 18:12:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 18:12:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2022-07-13 18:12:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:29,672 INFO L225 Difference]: With dead ends: 6136 [2022-07-13 18:12:29,687 INFO L226 Difference]: Without dead ends: 6133 [2022-07-13 18:12:29,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:12:29,691 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 549 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:29,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 278 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:12:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2022-07-13 18:12:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5560. [2022-07-13 18:12:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2022-07-13 18:12:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 7025 transitions. [2022-07-13 18:12:30,174 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 7025 transitions. Word has length 72 [2022-07-13 18:12:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:30,189 INFO L495 AbstractCegarLoop]: Abstraction has 5560 states and 7025 transitions. [2022-07-13 18:12:30,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:12:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 7025 transitions. [2022-07-13 18:12:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 18:12:30,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:30,191 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:30,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 18:12:30,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1866244794, now seen corresponding path program 1 times [2022-07-13 18:12:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:30,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494237559] [2022-07-13 18:12:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:30,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:30,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494237559] [2022-07-13 18:12:30,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494237559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:30,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030890212] [2022-07-13 18:12:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:30,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:12:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:30,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 18:12:30,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:30,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:31,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030890212] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:12:31,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:12:31,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-07-13 18:12:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028464136] [2022-07-13 18:12:31,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:31,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 18:12:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 18:12:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:12:31,008 INFO L87 Difference]: Start difference. First operand 5560 states and 7025 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 18:12:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:32,345 INFO L93 Difference]: Finished difference Result 13206 states and 16553 transitions. [2022-07-13 18:12:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 18:12:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 73 [2022-07-13 18:12:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:32,408 INFO L225 Difference]: With dead ends: 13206 [2022-07-13 18:12:32,408 INFO L226 Difference]: Without dead ends: 13203 [2022-07-13 18:12:32,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-07-13 18:12:32,416 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 1021 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:32,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 798 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 18:12:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2022-07-13 18:12:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 10818. [2022-07-13 18:12:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10818 states, 8399 states have (on average 1.249315394689844) internal successors, (10493), 8508 states have internal predecessors, (10493), 1191 states have call successors, (1191), 1025 states have call predecessors, (1191), 1227 states have return successors, (1955), 1290 states have call predecessors, (1955), 1190 states have call successors, (1955) [2022-07-13 18:12:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 13639 transitions. [2022-07-13 18:12:33,062 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 13639 transitions. Word has length 73 [2022-07-13 18:12:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:33,062 INFO L495 AbstractCegarLoop]: Abstraction has 10818 states and 13639 transitions. [2022-07-13 18:12:33,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 18:12:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 13639 transitions. [2022-07-13 18:12:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 18:12:33,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:33,065 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:33,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:33,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 18:12:33,278 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1600677641, now seen corresponding path program 2 times [2022-07-13 18:12:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:33,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310716664] [2022-07-13 18:12:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:33,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:33,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310716664] [2022-07-13 18:12:33,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310716664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:33,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:33,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:12:33,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643185892] [2022-07-13 18:12:33,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:33,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:33,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:33,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:33,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:12:33,324 INFO L87 Difference]: Start difference. First operand 10818 states and 13639 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:12:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:34,099 INFO L93 Difference]: Finished difference Result 17361 states and 21981 transitions. [2022-07-13 18:12:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:12:34,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 76 [2022-07-13 18:12:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:34,145 INFO L225 Difference]: With dead ends: 17361 [2022-07-13 18:12:34,159 INFO L226 Difference]: Without dead ends: 7423 [2022-07-13 18:12:34,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:12:34,204 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 202 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:34,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 439 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:12:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2022-07-13 18:12:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 6871. [2022-07-13 18:12:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6871 states, 5346 states have (on average 1.222035166479611) internal successors, (6533), 5411 states have internal predecessors, (6533), 758 states have call successors, (758), 649 states have call predecessors, (758), 766 states have return successors, (1174), 816 states have call predecessors, (1174), 757 states have call successors, (1174) [2022-07-13 18:12:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6871 states to 6871 states and 8465 transitions. [2022-07-13 18:12:34,705 INFO L78 Accepts]: Start accepts. Automaton has 6871 states and 8465 transitions. Word has length 76 [2022-07-13 18:12:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:34,705 INFO L495 AbstractCegarLoop]: Abstraction has 6871 states and 8465 transitions. [2022-07-13 18:12:34,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 18:12:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6871 states and 8465 transitions. [2022-07-13 18:12:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 18:12:34,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:34,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:34,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 18:12:34,708 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:34,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1691663828, now seen corresponding path program 1 times [2022-07-13 18:12:34,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:34,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761106572] [2022-07-13 18:12:34,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:34,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:12:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:12:34,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:34,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761106572] [2022-07-13 18:12:34,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761106572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:34,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:34,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:12:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517245791] [2022-07-13 18:12:34,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:34,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:12:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:12:34,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:34,769 INFO L87 Difference]: Start difference. First operand 6871 states and 8465 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:12:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:35,739 INFO L93 Difference]: Finished difference Result 20729 states and 25646 transitions. [2022-07-13 18:12:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 18:12:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-07-13 18:12:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:35,782 INFO L225 Difference]: With dead ends: 20729 [2022-07-13 18:12:35,783 INFO L226 Difference]: Without dead ends: 13886 [2022-07-13 18:12:35,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-07-13 18:12:35,803 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 715 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:35,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 456 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:12:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13886 states. [2022-07-13 18:12:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13886 to 13027. [2022-07-13 18:12:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13027 states, 10018 states have (on average 1.19944100618886) internal successors, (12016), 10185 states have internal predecessors, (12016), 1462 states have call successors, (1462), 1253 states have call predecessors, (1462), 1546 states have return successors, (2563), 1594 states have call predecessors, (2563), 1461 states have call successors, (2563) [2022-07-13 18:12:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 16041 transitions. [2022-07-13 18:12:36,686 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 16041 transitions. Word has length 83 [2022-07-13 18:12:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:36,687 INFO L495 AbstractCegarLoop]: Abstraction has 13027 states and 16041 transitions. [2022-07-13 18:12:36,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:12:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 16041 transitions. [2022-07-13 18:12:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 18:12:36,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:36,691 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:36,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 18:12:36,692 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647019, now seen corresponding path program 1 times [2022-07-13 18:12:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:36,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052363304] [2022-07-13 18:12:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:12:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:12:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:36,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052363304] [2022-07-13 18:12:36,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052363304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:36,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:36,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:12:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655055158] [2022-07-13 18:12:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:36,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:12:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:36,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:12:36,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:36,800 INFO L87 Difference]: Start difference. First operand 13027 states and 16041 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:12:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:38,467 INFO L93 Difference]: Finished difference Result 23901 states and 29354 transitions. [2022-07-13 18:12:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 18:12:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-07-13 18:12:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:38,522 INFO L225 Difference]: With dead ends: 23901 [2022-07-13 18:12:38,522 INFO L226 Difference]: Without dead ends: 11510 [2022-07-13 18:12:38,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-13 18:12:38,549 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 1035 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:38,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 520 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 18:12:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2022-07-13 18:12:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 10610. [2022-07-13 18:12:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 8186 states have (on average 1.1887368678231127) internal successors, (9731), 8322 states have internal predecessors, (9731), 1169 states have call successors, (1169), 1002 states have call predecessors, (1169), 1254 states have return successors, (1902), 1291 states have call predecessors, (1902), 1168 states have call successors, (1902) [2022-07-13 18:12:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 12802 transitions. [2022-07-13 18:12:39,526 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 12802 transitions. Word has length 92 [2022-07-13 18:12:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:39,527 INFO L495 AbstractCegarLoop]: Abstraction has 10610 states and 12802 transitions. [2022-07-13 18:12:39,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:12:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 12802 transitions. [2022-07-13 18:12:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-13 18:12:39,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:39,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:39,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 18:12:39,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash 578230399, now seen corresponding path program 1 times [2022-07-13 18:12:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:39,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131919912] [2022-07-13 18:12:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:12:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 18:12:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 18:12:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:12:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 18:12:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 18:12:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 18:12:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 18:12:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131919912] [2022-07-13 18:12:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131919912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595155199] [2022-07-13 18:12:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:39,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:39,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:39,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:12:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 18:12:39,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:12:39,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:39,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595155199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:39,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:39,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-07-13 18:12:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408525865] [2022-07-13 18:12:39,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:39,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:39,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:12:39,927 INFO L87 Difference]: Start difference. First operand 10610 states and 12802 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 18:12:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:40,508 INFO L93 Difference]: Finished difference Result 15682 states and 18945 transitions. [2022-07-13 18:12:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:12:40,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2022-07-13 18:12:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:40,529 INFO L225 Difference]: With dead ends: 15682 [2022-07-13 18:12:40,543 INFO L226 Difference]: Without dead ends: 5100 [2022-07-13 18:12:40,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:12:40,576 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 34 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:40,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 605 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2022-07-13 18:12:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4667. [2022-07-13 18:12:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3699 states have (on average 1.1732900783995674) internal successors, (4340), 3735 states have internal predecessors, (4340), 467 states have call successors, (467), 386 states have call predecessors, (467), 500 states have return successors, (738), 545 states have call predecessors, (738), 466 states have call successors, (738) [2022-07-13 18:12:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 5545 transitions. [2022-07-13 18:12:40,954 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 5545 transitions. Word has length 144 [2022-07-13 18:12:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:40,967 INFO L495 AbstractCegarLoop]: Abstraction has 4667 states and 5545 transitions. [2022-07-13 18:12:40,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 18:12:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 5545 transitions. [2022-07-13 18:12:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 18:12:40,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:40,975 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:41,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:41,191 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,SelfDestructingSolverStorable14 [2022-07-13 18:12:41,192 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -371595989, now seen corresponding path program 1 times [2022-07-13 18:12:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:41,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760509219] [2022-07-13 18:12:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:12:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:12:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 18:12:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:12:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:12:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 18:12:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:12:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 18:12:41,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:41,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760509219] [2022-07-13 18:12:41,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760509219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:41,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:41,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:12:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53432734] [2022-07-13 18:12:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:41,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:41,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:12:41,279 INFO L87 Difference]: Start difference. First operand 4667 states and 5545 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:12:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:41,666 INFO L93 Difference]: Finished difference Result 5210 states and 6157 transitions. [2022-07-13 18:12:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:12:41,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 146 [2022-07-13 18:12:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:41,676 INFO L225 Difference]: With dead ends: 5210 [2022-07-13 18:12:41,691 INFO L226 Difference]: Without dead ends: 4461 [2022-07-13 18:12:41,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:41,695 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 215 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:41,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 247 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:12:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2022-07-13 18:12:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 4242. [2022-07-13 18:12:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4242 states, 3370 states have (on average 1.175074183976261) internal successors, (3960), 3403 states have internal predecessors, (3960), 421 states have call successors, (421), 346 states have call predecessors, (421), 450 states have return successors, (674), 492 states have call predecessors, (674), 420 states have call successors, (674) [2022-07-13 18:12:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 5055 transitions. [2022-07-13 18:12:42,100 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 5055 transitions. Word has length 146 [2022-07-13 18:12:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:42,100 INFO L495 AbstractCegarLoop]: Abstraction has 4242 states and 5055 transitions. [2022-07-13 18:12:42,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:12:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 5055 transitions. [2022-07-13 18:12:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 18:12:42,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:42,122 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 18:12:42,123 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 83168210, now seen corresponding path program 1 times [2022-07-13 18:12:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:42,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049294256] [2022-07-13 18:12:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:12:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 18:12:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 18:12:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 18:12:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 18:12:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:12:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 18:12:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 18:12:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 18:12:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 18:12:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 18:12:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:42,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049294256] [2022-07-13 18:12:42,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049294256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:42,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180024181] [2022-07-13 18:12:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:42,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:42,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:42,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:12:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:42,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 18:12:42,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:42,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180024181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:42,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:42,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 18:12:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438484712] [2022-07-13 18:12:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:42,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:42,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:42,430 INFO L87 Difference]: Start difference. First operand 4242 states and 5055 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 18:12:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:42,542 INFO L93 Difference]: Finished difference Result 6078 states and 7215 transitions. [2022-07-13 18:12:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:42,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-07-13 18:12:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:42,548 INFO L225 Difference]: With dead ends: 6078 [2022-07-13 18:12:42,548 INFO L226 Difference]: Without dead ends: 2113 [2022-07-13 18:12:42,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:42,553 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:42,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-07-13 18:12:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2022-07-13 18:12:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1690 states have (on average 1.16094674556213) internal successors, (1962), 1707 states have internal predecessors, (1962), 202 states have call successors, (202), 168 states have call predecessors, (202), 220 states have return successors, (303), 237 states have call predecessors, (303), 201 states have call successors, (303) [2022-07-13 18:12:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2467 transitions. [2022-07-13 18:12:42,642 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2467 transitions. Word has length 157 [2022-07-13 18:12:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:42,642 INFO L495 AbstractCegarLoop]: Abstraction has 2113 states and 2467 transitions. [2022-07-13 18:12:42,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 18:12:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2467 transitions. [2022-07-13 18:12:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-13 18:12:42,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:42,646 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:42,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:42,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:42,863 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash 702759848, now seen corresponding path program 1 times [2022-07-13 18:12:42,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:42,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431221007] [2022-07-13 18:12:42,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:42,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:12:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:12:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:12:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 18:12:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 18:12:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 18:12:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 18:12:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 18:12:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431221007] [2022-07-13 18:12:42,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431221007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:42,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:42,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:12:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749289346] [2022-07-13 18:12:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:42,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:12:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:12:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:42,985 INFO L87 Difference]: Start difference. First operand 2113 states and 2467 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 18:12:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:43,383 INFO L93 Difference]: Finished difference Result 3977 states and 4677 transitions. [2022-07-13 18:12:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:12:43,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2022-07-13 18:12:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:43,389 INFO L225 Difference]: With dead ends: 3977 [2022-07-13 18:12:43,390 INFO L226 Difference]: Without dead ends: 2216 [2022-07-13 18:12:43,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:43,392 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 187 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:43,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 397 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2022-07-13 18:12:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1672. [2022-07-13 18:12:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1341 states have (on average 1.1670395227442207) internal successors, (1565), 1357 states have internal predecessors, (1565), 158 states have call successors, (158), 132 states have call predecessors, (158), 172 states have return successors, (235), 182 states have call predecessors, (235), 157 states have call successors, (235) [2022-07-13 18:12:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2022-07-13 18:12:43,547 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 158 [2022-07-13 18:12:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:43,547 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2022-07-13 18:12:43,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 18:12:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2022-07-13 18:12:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 18:12:43,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:43,550 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:43,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 18:12:43,550 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1973905068, now seen corresponding path program 1 times [2022-07-13 18:12:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:43,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240173401] [2022-07-13 18:12:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:12:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:12:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 18:12:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:12:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:12:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 18:12:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 18:12:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 18:12:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:43,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240173401] [2022-07-13 18:12:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240173401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:43,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821663823] [2022-07-13 18:12:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:43,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:43,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:43,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:43,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:12:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:43,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 18:12:43,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 18:12:43,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 18:12:44,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821663823] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:12:44,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:12:44,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-13 18:12:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582736421] [2022-07-13 18:12:44,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:44,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 18:12:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:44,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 18:12:44,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:12:44,106 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-07-13 18:12:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:45,333 INFO L93 Difference]: Finished difference Result 3707 states and 4436 transitions. [2022-07-13 18:12:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 18:12:45,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 161 [2022-07-13 18:12:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:45,339 INFO L225 Difference]: With dead ends: 3707 [2022-07-13 18:12:45,339 INFO L226 Difference]: Without dead ends: 1959 [2022-07-13 18:12:45,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2022-07-13 18:12:45,350 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1013 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:45,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 372 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 18:12:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2022-07-13 18:12:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1759. [2022-07-13 18:12:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1386 states have (on average 1.1392496392496392) internal successors, (1579), 1407 states have internal predecessors, (1579), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2022-07-13 18:12:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2045 transitions. [2022-07-13 18:12:45,514 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2045 transitions. Word has length 161 [2022-07-13 18:12:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:45,514 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2045 transitions. [2022-07-13 18:12:45,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-07-13 18:12:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2045 transitions. [2022-07-13 18:12:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-13 18:12:45,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:45,518 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:45,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:45,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:45,735 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash 11419214, now seen corresponding path program 1 times [2022-07-13 18:12:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:45,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831662102] [2022-07-13 18:12:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:12:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 18:12:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 18:12:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:12:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 18:12:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 18:12:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:12:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 18:12:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 18:12:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 18:12:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 18:12:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 18:12:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:45,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831662102] [2022-07-13 18:12:45,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831662102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:45,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721427145] [2022-07-13 18:12:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:45,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:45,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:45,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:45,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:12:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 18:12:46,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-13 18:12:46,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:46,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721427145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:46,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:46,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 18:12:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428566859] [2022-07-13 18:12:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:46,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:12:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:46,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:12:46,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:12:46,304 INFO L87 Difference]: Start difference. First operand 1759 states and 2045 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 18:12:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:46,568 INFO L93 Difference]: Finished difference Result 3404 states and 3968 transitions. [2022-07-13 18:12:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:12:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 178 [2022-07-13 18:12:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:46,572 INFO L225 Difference]: With dead ends: 3404 [2022-07-13 18:12:46,587 INFO L226 Difference]: Without dead ends: 1476 [2022-07-13 18:12:46,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:12:46,591 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:46,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 272 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:12:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2022-07-13 18:12:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1439. [2022-07-13 18:12:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1142 states have (on average 1.1287215411558669) internal successors, (1289), 1154 states have internal predecessors, (1289), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2022-07-13 18:12:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1648 transitions. [2022-07-13 18:12:46,694 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1648 transitions. Word has length 178 [2022-07-13 18:12:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:46,695 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 1648 transitions. [2022-07-13 18:12:46,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 18:12:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1648 transitions. [2022-07-13 18:12:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-13 18:12:46,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:46,698 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:46,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:46,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:46,912 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:46,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1242735248, now seen corresponding path program 1 times [2022-07-13 18:12:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:46,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998063397] [2022-07-13 18:12:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:12:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:12:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 18:12:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:12:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 18:12:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 18:12:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 18:12:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:12:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 18:12:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 18:12:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 18:12:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 18:12:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-13 18:12:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-13 18:12:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-13 18:12:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:47,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998063397] [2022-07-13 18:12:47,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998063397] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:47,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350755864] [2022-07-13 18:12:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:47,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:47,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:47,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:12:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 18:12:47,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 18:12:47,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-13 18:12:47,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350755864] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:12:47,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:12:47,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-07-13 18:12:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061108214] [2022-07-13 18:12:47,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:47,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 18:12:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:47,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 18:12:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:47,662 INFO L87 Difference]: Start difference. First operand 1439 states and 1648 transitions. Second operand has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-07-13 18:12:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:48,323 INFO L93 Difference]: Finished difference Result 1742 states and 1983 transitions. [2022-07-13 18:12:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:12:48,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 252 [2022-07-13 18:12:48,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:48,325 INFO L225 Difference]: With dead ends: 1742 [2022-07-13 18:12:48,325 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 18:12:48,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 546 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-07-13 18:12:48,327 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 270 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:48,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 439 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:12:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 18:12:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 18:12:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 18:12:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 18:12:48,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2022-07-13 18:12:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:48,329 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 18:12:48,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-07-13 18:12:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 18:12:48,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 18:12:48,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:12:48,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:48,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:48,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 18:13:10,826 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2022-07-13 18:13:10,826 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2022-07-13 18:13:10,827 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2022-07-13 18:13:10,827 INFO L895 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= ~p_num_write~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse18 (not (<= 2 ~q_write_ev~0))) (.cse19 (not (<= 1 ~c_dr_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse8 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse13 .cse14 .cse7 .cse15 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse13 .cse18 .cse19 .cse6 .cse14 .cse7 .cse15 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse11 .cse2 .cse12 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse6 .cse14 (not .cse0) .cse8 .cse9 .cse15 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse18 .cse19 .cse6 .cse14 .cse7 .cse8 .cse15 .cse10)))) [2022-07-13 18:13:10,827 INFO L895 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse2 (= ~p_dw_st~0 0)) (.cse29 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse28 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0))) (let ((.cse1 (not (= ~c_dr_st~0 0))) (.cse18 (and .cse29 .cse26 .cse28 .cse27)) (.cse4 (and .cse29 .cse28)) (.cse10 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse11 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse14 (not (<= 1 ~c_dr_pc~0))) (.cse22 (and .cse26 .cse27)) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse19 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse15 (not (= ~q_free~0 1))) (.cse16 (not (<= ~q_req_up~0 0))) (.cse20 (not (= ~q_read_ev~0 2))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse25 (not .cse2)) (.cse3 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~q_free~0 0))) (.cse21 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (and (= ~q_read_ev~0 1) .cse1 .cse2) .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9) (or .cse18 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse12 .cse19 (= ~q_write_ev~0 0) .cse7 .cse8 .cse16 .cse20 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse12 .cse21 .cse13 .cse14 .cse7 .cse15 .cse8 .cse20 .cse17 .cse22 .cse9) (or .cse3 .cse4 .cse23 .cse5 .cse24 .cse19 .cse21 .cse15 .cse8 .cse17 .cse9) (or .cse18 .cse3 .cse5 .cse6 .cse12 .cse19 .cse13 .cse7 .cse8 .cse16 .cse20 .cse9) (or .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse21 .cse13 .cse14 .cse7 .cse15 .cse8 .cse17 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse8 .cse16 .cse20 .cse17 .cse22 .cse9) (or .cse3 .cse23 .cse5 .cse24 .cse19 .cse21 .cse15 .cse8 .cse20 .cse17 .cse22 .cse9) (or (and .cse25 .cse26 .cse27) .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9) (or .cse0 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse23 .cse5 .cse24 (and .cse26 .cse28 .cse2 .cse27) .cse19 .cse7 .cse15 (not .cse3) .cse16 .cse20 .cse17 .cse9) (or .cse0 .cse25 .cse3 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9)))) [2022-07-13 18:13:10,827 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2022-07-13 18:13:10,827 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 307 331) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= ~p_num_write~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse18 (not (<= 2 ~q_write_ev~0))) (.cse19 (not (<= 1 ~c_dr_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse8 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse13 .cse14 .cse7 .cse15 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse13 .cse18 .cse19 .cse6 .cse14 .cse7 .cse15 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse11 .cse2 .cse12 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse6 .cse14 (not .cse0) .cse8 .cse9 .cse15 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse18 .cse19 .cse6 .cse14 .cse7 .cse8 .cse15 .cse10)))) [2022-07-13 18:13:10,827 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2022-07-13 18:13:10,827 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-07-13 18:13:10,827 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2022-07-13 18:13:10,827 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 251 270) the Hoare annotation is: true [2022-07-13 18:13:10,828 INFO L895 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse9 (= ~q_read_ev~0 2)) (.cse11 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse12 (not .cse5)) (.cse20 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not .cse11)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= ~q_free~0 0))) (.cse13 (not (<= ~c_dr_pc~0 1))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse18 (not .cse9)) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~q_req_up~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse8 .cse9) (not (<= ~p_num_write~0 1)) .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse2 .cse4 .cse7 .cse10) (or .cse0 .cse11 .cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse13 .cse14 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse7 .cse16 .cse19 .cse10) (or .cse0 .cse11 .cse12 .cse20 .cse2 .cse3 .cse13 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse8 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse4 .cse13 .cse5 .cse14 .cse6 .cse15 .cse7 .cse17 .cse18 .cse10)))) [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 251 270) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L895 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse26 (<= 1 ~c_dr_pc~0)) (.cse27 (<= ~c_dr_pc~0 1)) (.cse22 (= 1 ~c_dr_i~0)) (.cse23 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse25 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse24 (<= 0 is_do_read_c_triggered_~__retres1~1))) (let ((.cse5 (and .cse26 .cse27 .cse22 .cse23 .cse25 .cse24)) (.cse14 (not (= ~q_free~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not .cse27)) (.cse21 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse8 (not .cse26)) (.cse18 (not (<= ~c_dr_pc~0 0))) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (not (= ~p_num_write~0 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse6 (not .cse25)) (.cse16 (and .cse23 .cse24)) (.cse9 (not (= ~p_dw_i~0 1))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (<= ~q_req_up~0 0))) (.cse17 (not (= ~q_read_ev~0 2))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not .cse22))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse14 .cse4 .cse15 .cse6 (= ~q_write_ev~0 0) .cse16 .cse9 .cse11 .cse17 .cse13) (or .cse0 .cse2 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse9 .cse11 .cse17 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse18 .cse2 .cse14 .cse16 .cse9 .cse13) (or .cse0 .cse19 .cse2 .cse20 .cse15 .cse6 .cse21 .cse16 .cse10 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse21 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse18 (not .cse15) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse19 .cse2 .cse20 .cse6 .cse16 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13)))) [2022-07-13 18:13:10,828 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 80 98) the Hoare annotation is: true [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 80 98) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 271 288) the Hoare annotation is: (let ((.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse18 (not (= ~q_free~0 0))) (.cse17 (not (<= ~c_dr_pc~0 0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (and .cse22 (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (and .cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (not (<= ~c_dr_pc~0 1))) (.cse6 (= ~p_dw_st~0 0)) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse20 (not (<= ~q_req_up~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse4 .cse15 .cse6 .cse16 .cse7 .cse11 .cse12 .cse13) (or .cse0 .cse17 .cse2 .cse4 .cse18 .cse6 .cse10 .cse13) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse19 .cse10 .cse20 .cse13) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse16 .cse8 .cse19 .cse10 .cse20 .cse21 .cse13) (or .cse17 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse2 .cse15 .cse16 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13)))) [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2022-07-13 18:13:10,828 INFO L899 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 218 232) the Hoare annotation is: (let ((.cse18 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse9 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse10 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse30 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse11 (= ~q_read_ev~0 2))) (let ((.cse1 (not (= |old(~q_req_up~0)| 1))) (.cse8 (= ~q_req_up~0 1)) (.cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse3 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse26 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse6 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse23 (and .cse9 .cse10 .cse30 .cse11)) (.cse27 (not (= ~p_num_write~0 0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse24 (not (<= |old(~q_req_up~0)| 0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse25 (and .cse9 .cse10 .cse18 .cse30)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~q_free~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse1 .cse17 (and .cse8 .cse9 .cse10 .cse18) .cse4 .cse19 .cse6 .cse7 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse12 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse16) (or .cse0 .cse25 .cse17 .cse4 .cse19 .cse6 .cse7 .cse26 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse23 .cse4 .cse5 .cse6 .cse24 .cse7 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse25 .cse27 .cse4 .cse28 .cse7 .cse12 .cse26 .cse21 .cse22 .cse16) (or .cse0 .cse25 .cse17 .cse4 .cse19 .cse6 .cse24 .cse7 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse29 (not .cse7) .cse23 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse27 .cse4 .cse28 .cse24 .cse12 .cse14 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse29 .cse25 .cse4 .cse5 .cse7 .cse15 .cse16)))) [2022-07-13 18:13:10,829 INFO L895 garLoopResultBuilder]: At program point L48(lines 31 50) the Hoare annotation is: (let ((.cse16 (not (= |old(~q_req_up~0)| 1))) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (<= ~q_req_up~0 0)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse17 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse18 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= ~q_free~0 0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= |old(~q_req_up~0)| 0))) (.cse6 (= ~p_dw_st~0 0)) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (and .cse15 (= ~q_read_ev~0 2)) .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse14 .cse7 .cse20 .cse8 .cse9 .cse12) (or .cse0 .cse21 .cse2 .cse19 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse9 .cse12) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse16 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (and .cse15 .cse5) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse17 .cse18 .cse2 .cse19 .cse4 .cse13 .cse6 .cse14 .cse20 .cse8 .cse9 (= |old(~q_write_ev~0)| 0) .cse12) (or .cse21 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_num_write~0 0)) .cse2 (not (= ~c_num_read~0 0)) .cse13 .cse14 .cse20 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse19 .cse4 .cse13 .cse6 .cse14 .cse7 .cse20 .cse8 .cse9 .cse12))) [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L899 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2022-07-13 18:13:10,829 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 289 306) the Hoare annotation is: (let ((.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse22 (not (<= ~c_dr_pc~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (and .cse25 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse11 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse24 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse18 (not (= ~q_free~0 0))) (.cse5 (not (<= ~c_dr_pc~0 1))) (.cse6 (= ~p_dw_st~0 0)) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse20 (not (< 0 |old(~q_write_ev~0)|))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse21 (and .cse25 (= ~q_read_ev~0 2))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse4 .cse15 .cse6 .cse16 .cse7 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 (not (= |old(~q_read_ev~0)| 1)) .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse16 .cse19 .cse20 .cse10 .cse17 .cse21 .cse13) (or .cse22 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse2 .cse15 .cse16 .cse19 .cse10 .cse11 .cse17 .cse12 .cse21 .cse13) (or .cse0 .cse22 .cse2 .cse4 .cse18 .cse10 .cse13) (or .cse0 .cse23 .cse24 .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse19 .cse10 (= |old(~q_write_ev~0)| 0) .cse17 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13) (or .cse23 .cse24 .cse2 .cse18 .cse5 .cse6 .cse16 .cse19 .cse20 .cse9 .cse10 .cse17 .cse21 .cse13)))) [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse2 (= ~q_free~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (< ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= 1 ~c_dr_pc~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (< 0 ~q_write_ev~0)) (.cse11 (<= ~q_req_up~0 0)) (.cse12 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse9 .cse3 .cse4 .cse17 .cse13 .cse6 .cse7 .cse18) (and .cse1 .cse3 .cse4 .cse10 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse9 .cse3 .cse4 .cse5 .cse17 .cse11 .cse13 .cse6 .cse18) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse10 .cse5 .cse19 .cse11 .cse12 .cse13) (and .cse1 .cse15 .cse2 (= ~q_read_ev~0 1) .cse16 .cse9 .cse3 .cse4 .cse5 .cse17 .cse11 .cse13 .cse6 .cse18) (and .cse0 .cse1 .cse8 .cse15 .cse9 .cse4 .cse10 .cse5 .cse19 .cse11 .cse12 .cse13 .cse14))) [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L474(lines 465 476) the Hoare annotation is: (= 1 ~c_dr_i~0) [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: (= 1 ~c_dr_i~0) [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2022-07-13 18:13:10,830 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2022-07-13 18:13:10,830 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2022-07-13 18:13:10,831 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2022-07-13 18:13:10,831 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2022-07-13 18:13:10,831 INFO L895 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse0 (= ~p_dw_st~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~q_req_up~0 1) (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse9 .cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~q_req_up~0 0) .cse0 (= ~q_read_ev~0 2) .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))))) [2022-07-13 18:13:10,831 INFO L895 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2022-07-13 18:13:10,831 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2022-07-13 18:13:10,847 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2022-07-13 18:13:10,848 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= ~q_req_up~0 1)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 (<= 1 ~q_read_ev~0) .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse15 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse16 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse13 (<= ~c_dr_pc~0 0)) (and .cse8 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13))) [2022-07-13 18:13:10,848 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2022-07-13 18:13:10,848 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2022-07-13 18:13:10,848 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 416 441) the Hoare annotation is: (let ((.cse17 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse19 (<= ~c_dr_pc~0 0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse10 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (not .cse17)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse12 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse21 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse15 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14 .cse15 .cse8 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse14 .cse17 .cse18 .cse15 .cse8 .cse19) (and .cse1 .cse3 (not (= ~q_write_ev~0 0)) .cse20 .cse12 .cse5 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15 .cse22) (and .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse15 .cse8 .cse9 .cse16) (and .cse3 .cse5 .cse6 .cse21 .cse15 .cse19) (and .cse1 .cse3 .cse20 .cse10 .cse11 .cse12 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15 .cse22) (and .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14 .cse18 .cse15 .cse8 .cse16) (and .cse1 .cse3 .cse11 .cse12 .cse5 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15)))) [2022-07-13 18:13:10,848 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2022-07-13 18:13:10,849 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-07-13 18:13:10,849 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2022-07-13 18:13:10,849 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse4 (= ~q_free~0 1)) (.cse11 (<= ~q_req_up~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse15 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse12 (<= 1 ~q_read_ev~0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse10 .cse15 .cse5 .cse6 .cse7 .cse11 .cse16 .cse8) (and .cse17 .cse1 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse14 .cse10 .cse15 .cse5 .cse6 .cse13 .cse7 .cse16 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 (<= ~p_num_write~0 1) .cse12 .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2022-07-13 18:13:10,849 INFO L899 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-07-13 18:13:10,849 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2022-07-13 18:13:10,849 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 18:13:10,849 INFO L895 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-07-13 18:13:10,849 INFO L899 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2022-07-13 18:13:10,849 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2022-07-13 18:13:10,850 INFO L895 garLoopResultBuilder]: At program point L462(lines 448 464) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-07-13 18:13:10,850 INFO L895 garLoopResultBuilder]: At program point L173(lines 168 216) the Hoare annotation is: (and (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (< ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= 1 ~c_dr_i~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-07-13 18:13:10,850 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2022-07-13 18:13:10,850 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2022-07-13 18:13:10,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 18:13:10,850 INFO L895 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= ~q_req_up~0 1)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 (<= 1 ~q_read_ev~0) .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse15 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse16 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse13 (<= ~c_dr_pc~0 0)) (and .cse8 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13))) [2022-07-13 18:13:10,850 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2022-07-13 18:13:10,850 INFO L895 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse8 (<= ~c_dr_pc~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse3 .cse9 .cse5 (= ~q_free~0 0) .cse6 .cse7 .cse8) (and .cse1 .cse3 (<= 1 ~c_dr_pc~0) .cse4 (<= ~c_dr_pc~0 1) .cse9 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-07-13 18:13:10,851 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse12 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse0 (= ~p_num_write~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse18 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse13 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse13 .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse18 .cse8 .cse9 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse17 .cse8 .cse9 .cse12 .cse19) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse8 .cse9 .cse19) (and .cse11 .cse2 .cse23 .cse14 .cse15 .cse16 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse22 .cse8 .cse9 .cse19) (and .cse13 .cse11 .cse1 .cse2 .cse15 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse18 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse13 .cse11 .cse2 .cse23 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2022-07-13 18:13:10,851 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-07-13 18:13:10,851 INFO L895 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-07-13 18:13:10,851 INFO L895 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 (<= ~c_dr_pc~0 1) .cse4 .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 (= ~q_read_ev~0 2) .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse7 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2022-07-13 18:13:10,851 INFO L895 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-07-13 18:13:10,852 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse12 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse0 (= ~p_num_write~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse18 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse13 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse13 .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse18 .cse8 .cse9 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse17 .cse8 .cse9 .cse12 .cse19) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse8 .cse9 .cse19) (and .cse11 .cse2 .cse23 .cse14 .cse15 .cse16 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse22 .cse8 .cse9 .cse19) (and .cse13 .cse11 .cse1 .cse2 .cse15 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse18 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse13 .cse11 .cse2 .cse23 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2022-07-13 18:13:10,852 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2022-07-13 18:13:10,852 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 168 216) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse2 (= ~c_num_read~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not .cse12)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse9 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse8 (<= 1 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_free~0 0) .cse7 (<= ~p_num_write~0 1) .cse8 .cse9 .cse10 (<= 1 ~p_num_write~0)) (and (= ~p_num_write~0 0) .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse9 .cse13 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and (let ((.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse3 .cse11 .cse4 (<= ~c_dr_pc~0 1) .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 .cse14 .cse9 .cse13 .cse15) (and .cse0 .cse1 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse14 .cse9 .cse13 .cse10 .cse15))) .cse8)))) [2022-07-13 18:13:10,852 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13))) [2022-07-13 18:13:10,852 INFO L895 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13))) [2022-07-13 18:13:10,853 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2022-07-13 18:13:10,853 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2022-07-13 18:13:10,853 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 61 79) no Hoare annotation was computed. [2022-07-13 18:13:10,853 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2022-07-13 18:13:10,853 INFO L895 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse18 (not (<= ~c_dr_pc~0 0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse1 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse9 (not (<= ~q_req_up~0 0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse16 .cse17 .cse11) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse5 .cse14 .cse8 .cse11) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse5 .cse8 .cse10 .cse11) (or .cse0 .cse19 .cse1 .cse2 .cse20 .cse5 .cse6 .cse14 .cse16 .cse17 .cse11) (or .cse18 (not .cse5) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse19 .cse1 .cse2 .cse20 .cse6 .cse8 .cse16 .cse9 .cse10 .cse17 .cse11) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_write_ev~0 0) .cse8 .cse9 .cse10 .cse11) (or .cse0 (= ~q_read_ev~0 1) .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse7 .cse15 .cse8 .cse16 .cse9 .cse17 .cse11))) [2022-07-13 18:13:10,853 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 61 79) the Hoare annotation is: true [2022-07-13 18:13:10,853 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2022-07-13 18:13:10,853 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-07-13 18:13:10,854 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-07-13 18:13:10,854 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2022-07-13 18:13:10,854 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2022-07-13 18:13:10,872 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:10,874 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:13:10,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:13:10 BoogieIcfgContainer [2022-07-13 18:13:10,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:13:10,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:13:10,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:13:10,946 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:13:10,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:20" (3/4) ... [2022-07-13 18:13:10,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 18:13:10,965 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-07-13 18:13:10,966 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-07-13 18:13:10,966 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-07-13 18:13:10,966 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-07-13 18:13:10,966 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-07-13 18:13:10,966 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-07-13 18:13:10,966 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-07-13 18:13:10,966 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-07-13 18:13:10,974 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-13 18:13:10,975 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 18:13:10,975 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 18:13:10,975 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 18:13:11,005 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) [2022-07-13 18:13:11,060 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:13:11,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:13:11,061 INFO L158 Benchmark]: Toolchain (without parser) took 52176.23ms. Allocated memory was 159.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 123.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-13 18:13:11,067 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:13:11,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.75ms. Allocated memory is still 159.4MB. Free memory was 122.9MB in the beginning and 129.7MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:13:11,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.62ms. Allocated memory is still 159.4MB. Free memory was 129.7MB in the beginning and 127.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:13:11,068 INFO L158 Benchmark]: Boogie Preprocessor took 51.30ms. Allocated memory is still 159.4MB. Free memory was 127.6MB in the beginning and 126.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:13:11,068 INFO L158 Benchmark]: RCFGBuilder took 595.91ms. Allocated memory is still 159.4MB. Free memory was 126.0MB in the beginning and 111.0MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 18:13:11,068 INFO L158 Benchmark]: TraceAbstraction took 50870.37ms. Allocated memory was 159.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 110.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-13 18:13:11,068 INFO L158 Benchmark]: Witness Printer took 114.60ms. Allocated memory is still 2.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 18:13:11,069 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.16ms. Allocated memory is still 79.7MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.75ms. Allocated memory is still 159.4MB. Free memory was 122.9MB in the beginning and 129.7MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.62ms. Allocated memory is still 159.4MB. Free memory was 129.7MB in the beginning and 127.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.30ms. Allocated memory is still 159.4MB. Free memory was 127.6MB in the beginning and 126.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 595.91ms. Allocated memory is still 159.4MB. Free memory was 126.0MB in the beginning and 111.0MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 50870.37ms. Allocated memory was 159.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 110.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 114.60ms. Allocated memory is still 2.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.7s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9054 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8862 mSDsluCounter, 9444 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6103 mSDsCounter, 2652 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7997 IncrementalHoareTripleChecker+Invalid, 10649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2652 mSolverCounterUnsat, 3341 mSDtfsCounter, 7997 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2315 GetRequests, 1977 SyntacticMatches, 14 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13027occurred in iteration=13, InterpolantAutomatonStates: 288, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 8264 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 11931 PreInvPairs, 12450 NumberOfFragments, 9614 HoareAnnotationTreeSize, 11931 FomulaSimplifications, 1456 FormulaSimplificationTreeSizeReduction, 4.1s HoareSimplificationTime, 41 FomulaSimplificationsInter, 246945 FormulaSimplificationTreeSizeReductionInter, 17.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 3134 NumberOfCodeBlocks, 3134 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3590 ConstructedInterpolants, 0 QuantifiedInterpolants, 7249 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3063 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 1916/1975 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) || ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && c_num_read < p_num_write + 1)) && 1 <= q_read_ev) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || ((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0) || (((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1)) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(q_read_ev == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || (((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 == c_dr_i) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && ((((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || (((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 == c_dr_i) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((c_dr_st == 0 || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((c_dr_st == 0 || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(q_req_up == 1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(p_num_write <= 1)) || !(1 == c_dr_i)) && (((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc <= 1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) || ((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && c_num_read < p_num_write + 1) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) RESULT: Ultimate proved your program to be correct! [2022-07-13 18:13:11,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE