./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.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 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 20:28:43,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 20:28:43,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 20:28:43,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 20:28:43,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 20:28:43,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 20:28:43,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 20:28:43,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 20:28:43,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 20:28:43,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 20:28:43,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 20:28:43,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 20:28:43,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 20:28:43,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 20:28:43,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 20:28:43,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 20:28:43,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 20:28:43,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 20:28:43,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 20:28:43,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 20:28:43,128 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 20:28:43,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 20:28:43,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 20:28:43,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 20:28:43,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 20:28:43,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 20:28:43,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 20:28:43,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 20:28:43,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 20:28:43,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 20:28:43,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 20:28:43,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 20:28:43,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 20:28:43,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 20:28:43,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 20:28:43,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 20:28:43,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 20:28:43,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 20:28:43,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 20:28:43,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 20:28:43,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 20:28:43,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 20:28:43,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 20:28:43,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 20:28:43,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 20:28:43,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 20:28:43,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 20:28:43,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 20:28:43,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 20:28:43,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 20:28:43,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 20:28:43,182 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 20:28:43,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 20:28:43,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 20:28:43,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 20:28:43,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 20:28:43,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 20:28:43,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 20:28:43,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 20:28:43,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 20:28:43,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 20:28:43,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 20:28:43,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 20:28:43,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 20:28:43,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 20:28:43,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 20:28:43,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 20:28:43,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:28:43,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 20:28:43,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 20:28:43,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 20:28:43,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 20:28:43,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 20:28:43,187 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 20:28:43,187 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 20:28:43,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 20:28:43,187 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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2022-07-19 20:28:43,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 20:28:43,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 20:28:43,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 20:28:43,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 20:28:43,399 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 20:28:43,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-07-19 20:28:43,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ab5c213/9bb1b3088ae345ad9753102da68ef6f6/FLAGff8ee0386 [2022-07-19 20:28:43,826 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 20:28:43,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-07-19 20:28:43,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ab5c213/9bb1b3088ae345ad9753102da68ef6f6/FLAGff8ee0386 [2022-07-19 20:28:43,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ab5c213/9bb1b3088ae345ad9753102da68ef6f6 [2022-07-19 20:28:43,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 20:28:43,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 20:28:43,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 20:28:43,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 20:28:43,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 20:28:43,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:28:43" (1/1) ... [2022-07-19 20:28:43,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47442ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:43, skipping insertion in model container [2022-07-19 20:28:43,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 08:28:43" (1/1) ... [2022-07-19 20:28:43,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 20:28:43,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 20:28:44,048 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-07-19 20:28:44,079 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-07-19 20:28:44,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:28:44,108 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 20:28:44,118 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-07-19 20:28:44,131 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-07-19 20:28:44,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 20:28:44,169 INFO L208 MainTranslator]: Completed translation [2022-07-19 20:28:44,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44 WrapperNode [2022-07-19 20:28:44,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 20:28:44,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 20:28:44,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 20:28:44,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 20:28:44,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,212 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2022-07-19 20:28:44,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 20:28:44,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 20:28:44,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 20:28:44,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 20:28:44,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 20:28:44,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 20:28:44,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 20:28:44,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 20:28:44,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (1/1) ... [2022-07-19 20:28:44,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 20:28:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:28:44,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 20:28:44,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 20:28:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 20:28:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-19 20:28:44,336 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-19 20:28:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-07-19 20:28:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-07-19 20:28:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-19 20:28:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-19 20:28:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-19 20:28:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-19 20:28:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-19 20:28:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-19 20:28:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-19 20:28:44,339 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-19 20:28:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-19 20:28:44,339 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-19 20:28:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 20:28:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-19 20:28:44,340 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-19 20:28:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 20:28:44,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 20:28:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-19 20:28:44,340 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-19 20:28:44,411 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 20:28:44,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 20:28:44,771 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 20:28:44,780 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 20:28:44,780 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-19 20:28:44,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:28:44 BoogieIcfgContainer [2022-07-19 20:28:44,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 20:28:44,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 20:28:44,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 20:28:44,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 20:28:44,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 08:28:43" (1/3) ... [2022-07-19 20:28:44,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c36ed65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:28:44, skipping insertion in model container [2022-07-19 20:28:44,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 08:28:44" (2/3) ... [2022-07-19 20:28:44,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c36ed65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 08:28:44, skipping insertion in model container [2022-07-19 20:28:44,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:28:44" (3/3) ... [2022-07-19 20:28:44,799 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-07-19 20:28:44,811 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 20:28:44,811 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 20:28:44,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 20:28:44,864 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@22fd0974, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fdc4c2a [2022-07-19 20:28:44,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 20:28:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-19 20:28:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 20:28:44,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:44,880 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] [2022-07-19 20:28:44,881 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2022-07-19 20:28:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:44,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927603154] [2022-07-19 20:28:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 20:28:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:45,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:45,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927603154] [2022-07-19 20:28:45,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927603154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:45,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:45,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 20:28:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92410775] [2022-07-19 20:28:45,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:45,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:28:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:45,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:28:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 20:28:45,178 INFO L87 Difference]: Start difference. First operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 20:28:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:45,451 INFO L93 Difference]: Finished difference Result 414 states and 624 transitions. [2022-07-19 20:28:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 20:28:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-19 20:28:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:45,469 INFO L225 Difference]: With dead ends: 414 [2022-07-19 20:28:45,469 INFO L226 Difference]: Without dead ends: 239 [2022-07-19 20:28:45,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:45,479 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 284 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:45,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 471 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 20:28:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-19 20:28:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2022-07-19 20:28:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-07-19 20:28:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2022-07-19 20:28:45,581 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 44 [2022-07-19 20:28:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:45,581 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2022-07-19 20:28:45,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 20:28:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2022-07-19 20:28:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 20:28:45,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:45,591 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] [2022-07-19 20:28:45,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 20:28:45,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2022-07-19 20:28:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:45,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976248995] [2022-07-19 20:28:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 20:28:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:45,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976248995] [2022-07-19 20:28:45,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976248995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:45,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:45,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 20:28:45,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370500472] [2022-07-19 20:28:45,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:45,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:28:45,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:45,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:28:45,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 20:28:45,729 INFO L87 Difference]: Start difference. First operand 233 states and 328 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 20:28:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:45,911 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2022-07-19 20:28:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 20:28:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-19 20:28:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:45,922 INFO L225 Difference]: With dead ends: 481 [2022-07-19 20:28:45,922 INFO L226 Difference]: Without dead ends: 357 [2022-07-19 20:28:45,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:45,924 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 148 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:45,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 568 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 20:28:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-07-19 20:28:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2022-07-19 20:28:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-07-19 20:28:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2022-07-19 20:28:45,951 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 45 [2022-07-19 20:28:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:45,952 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2022-07-19 20:28:45,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 20:28:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2022-07-19 20:28:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 20:28:45,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:45,954 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] [2022-07-19 20:28:45,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 20:28:45,954 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2022-07-19 20:28:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:45,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123318012] [2022-07-19 20:28:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 20:28:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:46,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123318012] [2022-07-19 20:28:46,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123318012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:46,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:46,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 20:28:46,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325724406] [2022-07-19 20:28:46,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:46,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:28:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:46,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:28:46,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 20:28:46,023 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 20:28:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:46,144 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2022-07-19 20:28:46,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 20:28:46,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-19 20:28:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:46,149 INFO L225 Difference]: With dead ends: 708 [2022-07-19 20:28:46,149 INFO L226 Difference]: Without dead ends: 517 [2022-07-19 20:28:46,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:46,156 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 293 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:46,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 462 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 20:28:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-19 20:28:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2022-07-19 20:28:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-07-19 20:28:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2022-07-19 20:28:46,190 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 45 [2022-07-19 20:28:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:46,191 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2022-07-19 20:28:46,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 20:28:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2022-07-19 20:28:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:46,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:46,193 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] [2022-07-19 20:28:46,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 20:28:46,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2022-07-19 20:28:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:46,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428007361] [2022-07-19 20:28:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:46,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428007361] [2022-07-19 20:28:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428007361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:46,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:46,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:28:46,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941847188] [2022-07-19 20:28:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:46,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:28:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:46,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:28:46,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:46,259 INFO L87 Difference]: Start difference. First operand 465 states and 636 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:46,506 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2022-07-19 20:28:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:28:46,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:46,510 INFO L225 Difference]: With dead ends: 582 [2022-07-19 20:28:46,511 INFO L226 Difference]: Without dead ends: 486 [2022-07-19 20:28:46,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:28:46,521 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 263 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:46,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 514 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 20:28:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-19 20:28:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2022-07-19 20:28:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-07-19 20:28:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2022-07-19 20:28:46,558 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 57 [2022-07-19 20:28:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:46,560 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2022-07-19 20:28:46,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2022-07-19 20:28:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:46,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:46,565 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] [2022-07-19 20:28:46,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 20:28:46,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2022-07-19 20:28:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:46,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935236300] [2022-07-19 20:28:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:46,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935236300] [2022-07-19 20:28:46,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935236300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:46,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:46,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:28:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501782125] [2022-07-19 20:28:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:46,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:28:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:46,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:28:46,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:28:46,703 INFO L87 Difference]: Start difference. First operand 465 states and 635 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:47,236 INFO L93 Difference]: Finished difference Result 689 states and 962 transitions. [2022-07-19 20:28:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:28:47,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:47,243 INFO L225 Difference]: With dead ends: 689 [2022-07-19 20:28:47,243 INFO L226 Difference]: Without dead ends: 596 [2022-07-19 20:28:47,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:28:47,245 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 434 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:47,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 660 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:28:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-19 20:28:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 555. [2022-07-19 20:28:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-07-19 20:28:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 763 transitions. [2022-07-19 20:28:47,291 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 763 transitions. Word has length 57 [2022-07-19 20:28:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:47,291 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 763 transitions. [2022-07-19 20:28:47,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 763 transitions. [2022-07-19 20:28:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:47,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:47,293 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] [2022-07-19 20:28:47,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 20:28:47,293 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1340236402, now seen corresponding path program 1 times [2022-07-19 20:28:47,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:47,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15165879] [2022-07-19 20:28:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:47,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15165879] [2022-07-19 20:28:47,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15165879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:47,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:47,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:28:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835682718] [2022-07-19 20:28:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:47,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:28:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:47,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:28:47,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:47,361 INFO L87 Difference]: Start difference. First operand 555 states and 763 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:47,948 INFO L93 Difference]: Finished difference Result 887 states and 1237 transitions. [2022-07-19 20:28:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 20:28:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:47,952 INFO L225 Difference]: With dead ends: 887 [2022-07-19 20:28:47,952 INFO L226 Difference]: Without dead ends: 704 [2022-07-19 20:28:47,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:28:47,954 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 424 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:47,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 984 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:28:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-07-19 20:28:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 640. [2022-07-19 20:28:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-07-19 20:28:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 880 transitions. [2022-07-19 20:28:47,984 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 880 transitions. Word has length 57 [2022-07-19 20:28:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:47,984 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 880 transitions. [2022-07-19 20:28:47,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 880 transitions. [2022-07-19 20:28:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:47,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:47,986 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] [2022-07-19 20:28:47,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 20:28:47,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash 905343052, now seen corresponding path program 1 times [2022-07-19 20:28:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:47,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985398819] [2022-07-19 20:28:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:48,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:48,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985398819] [2022-07-19 20:28:48,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985398819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:48,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:48,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:28:48,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653264048] [2022-07-19 20:28:48,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:48,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:28:48,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:48,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:28:48,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:48,051 INFO L87 Difference]: Start difference. First operand 640 states and 880 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:48,704 INFO L93 Difference]: Finished difference Result 1198 states and 1670 transitions. [2022-07-19 20:28:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 20:28:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:48,709 INFO L225 Difference]: With dead ends: 1198 [2022-07-19 20:28:48,709 INFO L226 Difference]: Without dead ends: 930 [2022-07-19 20:28:48,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-19 20:28:48,711 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 435 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:48,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 959 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 20:28:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-07-19 20:28:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 798. [2022-07-19 20:28:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-07-19 20:28:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2022-07-19 20:28:48,752 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 57 [2022-07-19 20:28:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:48,752 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2022-07-19 20:28:48,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2022-07-19 20:28:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:48,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:48,754 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] [2022-07-19 20:28:48,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 20:28:48,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1153489546, now seen corresponding path program 1 times [2022-07-19 20:28:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:48,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040726437] [2022-07-19 20:28:48,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:48,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:48,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040726437] [2022-07-19 20:28:48,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040726437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:48,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:48,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:28:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33722459] [2022-07-19 20:28:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:48,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:28:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:48,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:28:48,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:48,843 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:49,332 INFO L93 Difference]: Finished difference Result 1381 states and 1951 transitions. [2022-07-19 20:28:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 20:28:49,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:49,337 INFO L225 Difference]: With dead ends: 1381 [2022-07-19 20:28:49,337 INFO L226 Difference]: Without dead ends: 956 [2022-07-19 20:28:49,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-19 20:28:49,340 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 224 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:49,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 852 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 20:28:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-07-19 20:28:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 813. [2022-07-19 20:28:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-07-19 20:28:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1116 transitions. [2022-07-19 20:28:49,381 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1116 transitions. Word has length 57 [2022-07-19 20:28:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:49,381 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1116 transitions. [2022-07-19 20:28:49,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1116 transitions. [2022-07-19 20:28:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:49,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:49,383 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] [2022-07-19 20:28:49,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 20:28:49,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1081102988, now seen corresponding path program 1 times [2022-07-19 20:28:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261400810] [2022-07-19 20:28:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:49,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261400810] [2022-07-19 20:28:49,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261400810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:49,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:49,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:28:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980564983] [2022-07-19 20:28:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:49,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:28:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:49,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:28:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:28:49,443 INFO L87 Difference]: Start difference. First operand 813 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:49,920 INFO L93 Difference]: Finished difference Result 1803 states and 2499 transitions. [2022-07-19 20:28:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:28:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:49,927 INFO L225 Difference]: With dead ends: 1803 [2022-07-19 20:28:49,927 INFO L226 Difference]: Without dead ends: 1363 [2022-07-19 20:28:49,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-19 20:28:49,930 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 563 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:49,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 775 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:28:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2022-07-19 20:28:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1204. [2022-07-19 20:28:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-07-19 20:28:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1644 transitions. [2022-07-19 20:28:49,989 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1644 transitions. Word has length 57 [2022-07-19 20:28:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:49,989 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 1644 transitions. [2022-07-19 20:28:49,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1644 transitions. [2022-07-19 20:28:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:49,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:49,991 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] [2022-07-19 20:28:49,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 20:28:49,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -690367987, now seen corresponding path program 1 times [2022-07-19 20:28:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:49,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355130532] [2022-07-19 20:28:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:50,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355130532] [2022-07-19 20:28:50,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355130532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:50,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:50,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:28:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945057571] [2022-07-19 20:28:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:28:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:28:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:50,058 INFO L87 Difference]: Start difference. First operand 1204 states and 1644 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:50,563 INFO L93 Difference]: Finished difference Result 2242 states and 3103 transitions. [2022-07-19 20:28:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 20:28:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:50,570 INFO L225 Difference]: With dead ends: 2242 [2022-07-19 20:28:50,571 INFO L226 Difference]: Without dead ends: 1411 [2022-07-19 20:28:50,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-19 20:28:50,574 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 190 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:50,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 846 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 20:28:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-07-19 20:28:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1219. [2022-07-19 20:28:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-07-19 20:28:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1654 transitions. [2022-07-19 20:28:50,638 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1654 transitions. Word has length 57 [2022-07-19 20:28:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:50,639 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1654 transitions. [2022-07-19 20:28:50,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1654 transitions. [2022-07-19 20:28:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:50,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:50,641 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] [2022-07-19 20:28:50,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 20:28:50,641 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1232860047, now seen corresponding path program 1 times [2022-07-19 20:28:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:50,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711196926] [2022-07-19 20:28:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:50,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:50,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711196926] [2022-07-19 20:28:50,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711196926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:50,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:50,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:28:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371977077] [2022-07-19 20:28:50,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:50,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:28:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:50,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:28:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:28:50,724 INFO L87 Difference]: Start difference. First operand 1219 states and 1654 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:51,313 INFO L93 Difference]: Finished difference Result 1767 states and 2397 transitions. [2022-07-19 20:28:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 20:28:51,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:51,321 INFO L225 Difference]: With dead ends: 1767 [2022-07-19 20:28:51,321 INFO L226 Difference]: Without dead ends: 1237 [2022-07-19 20:28:51,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-07-19 20:28:51,324 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 487 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:51,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 881 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:28:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-07-19 20:28:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1051. [2022-07-19 20:28:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2022-07-19 20:28:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1411 transitions. [2022-07-19 20:28:51,379 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1411 transitions. Word has length 57 [2022-07-19 20:28:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:51,379 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1411 transitions. [2022-07-19 20:28:51,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1411 transitions. [2022-07-19 20:28:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:51,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:51,389 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] [2022-07-19 20:28:51,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 20:28:51,390 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1451714765, now seen corresponding path program 1 times [2022-07-19 20:28:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:51,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713921174] [2022-07-19 20:28:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:51,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:51,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713921174] [2022-07-19 20:28:51,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713921174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:51,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:51,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:28:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802636952] [2022-07-19 20:28:51,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:51,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:28:51,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:51,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:28:51,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:28:51,466 INFO L87 Difference]: Start difference. First operand 1051 states and 1411 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:52,131 INFO L93 Difference]: Finished difference Result 2334 states and 3104 transitions. [2022-07-19 20:28:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 20:28:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:52,140 INFO L225 Difference]: With dead ends: 2334 [2022-07-19 20:28:52,141 INFO L226 Difference]: Without dead ends: 1657 [2022-07-19 20:28:52,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-07-19 20:28:52,144 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 493 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:52,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 890 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 20:28:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-07-19 20:28:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1365. [2022-07-19 20:28:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2022-07-19 20:28:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1819 transitions. [2022-07-19 20:28:52,235 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1819 transitions. Word has length 57 [2022-07-19 20:28:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:52,235 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1819 transitions. [2022-07-19 20:28:52,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1819 transitions. [2022-07-19 20:28:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:52,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:52,237 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] [2022-07-19 20:28:52,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 20:28:52,238 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1874416591, now seen corresponding path program 1 times [2022-07-19 20:28:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:52,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254625009] [2022-07-19 20:28:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:52,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:52,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:52,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254625009] [2022-07-19 20:28:52,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254625009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:52,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:52,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:28:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790374840] [2022-07-19 20:28:52,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:52,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:28:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:28:52,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:28:52,316 INFO L87 Difference]: Start difference. First operand 1365 states and 1819 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:52,942 INFO L93 Difference]: Finished difference Result 2334 states and 3094 transitions. [2022-07-19 20:28:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 20:28:52,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-19 20:28:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:52,949 INFO L225 Difference]: With dead ends: 2334 [2022-07-19 20:28:52,950 INFO L226 Difference]: Without dead ends: 1633 [2022-07-19 20:28:52,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-07-19 20:28:52,953 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 479 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:52,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 876 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:28:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-19 20:28:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1355. [2022-07-19 20:28:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2022-07-19 20:28:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1797 transitions. [2022-07-19 20:28:53,025 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1797 transitions. Word has length 57 [2022-07-19 20:28:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:53,026 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 1797 transitions. [2022-07-19 20:28:53,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 20:28:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1797 transitions. [2022-07-19 20:28:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 20:28:53,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:53,028 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] [2022-07-19 20:28:53,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 20:28:53,029 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2022-07-19 20:28:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519402060] [2022-07-19 20:28:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:53,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519402060] [2022-07-19 20:28:53,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519402060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:53,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:53,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:28:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497303299] [2022-07-19 20:28:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:53,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:28:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:28:53,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:53,082 INFO L87 Difference]: Start difference. First operand 1355 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 20:28:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:53,419 INFO L93 Difference]: Finished difference Result 2962 states and 3933 transitions. [2022-07-19 20:28:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 20:28:53,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-07-19 20:28:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:53,428 INFO L225 Difference]: With dead ends: 2962 [2022-07-19 20:28:53,428 INFO L226 Difference]: Without dead ends: 1977 [2022-07-19 20:28:53,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:28:53,432 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 443 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:53,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 499 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 20:28:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-07-19 20:28:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1759. [2022-07-19 20:28:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2022-07-19 20:28:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2301 transitions. [2022-07-19 20:28:53,532 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2301 transitions. Word has length 57 [2022-07-19 20:28:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:53,532 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2301 transitions. [2022-07-19 20:28:53,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 20:28:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2301 transitions. [2022-07-19 20:28:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 20:28:53,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:53,534 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] [2022-07-19 20:28:53,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 20:28:53,534 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2022-07-19 20:28:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:53,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760505726] [2022-07-19 20:28:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 20:28:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,573 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-19 20:28:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:53,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760505726] [2022-07-19 20:28:53,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760505726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:53,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:53,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 20:28:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190163009] [2022-07-19 20:28:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:53,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:28:53,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:28:53,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 20:28:53,575 INFO L87 Difference]: Start difference. First operand 1759 states and 2301 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 20:28:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:53,784 INFO L93 Difference]: Finished difference Result 2343 states and 3086 transitions. [2022-07-19 20:28:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 20:28:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-07-19 20:28:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:53,793 INFO L225 Difference]: With dead ends: 2343 [2022-07-19 20:28:53,793 INFO L226 Difference]: Without dead ends: 1987 [2022-07-19 20:28:53,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:53,797 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 132 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:53,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 620 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 20:28:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-07-19 20:28:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1949. [2022-07-19 20:28:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2022-07-19 20:28:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2539 transitions. [2022-07-19 20:28:53,896 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2539 transitions. Word has length 62 [2022-07-19 20:28:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:53,896 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 2539 transitions. [2022-07-19 20:28:53,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 20:28:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2539 transitions. [2022-07-19 20:28:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 20:28:53,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:53,898 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] [2022-07-19 20:28:53,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 20:28:53,899 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2022-07-19 20:28:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:53,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766780658] [2022-07-19 20:28:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 20:28:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 20:28:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 20:28:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:53,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766780658] [2022-07-19 20:28:53,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766780658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:53,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:53,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 20:28:53,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457075854] [2022-07-19 20:28:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:53,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:28:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:28:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 20:28:53,937 INFO L87 Difference]: Start difference. First operand 1949 states and 2539 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 20:28:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:54,109 INFO L93 Difference]: Finished difference Result 2602 states and 3392 transitions. [2022-07-19 20:28:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 20:28:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-07-19 20:28:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:54,117 INFO L225 Difference]: With dead ends: 2602 [2022-07-19 20:28:54,117 INFO L226 Difference]: Without dead ends: 2148 [2022-07-19 20:28:54,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:54,119 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 279 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:54,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 457 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 20:28:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-07-19 20:28:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2093. [2022-07-19 20:28:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-07-19 20:28:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2712 transitions. [2022-07-19 20:28:54,227 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2712 transitions. Word has length 67 [2022-07-19 20:28:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:54,228 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 2712 transitions. [2022-07-19 20:28:54,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 20:28:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2712 transitions. [2022-07-19 20:28:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 20:28:54,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:54,230 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:28:54,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 20:28:54,231 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2022-07-19 20:28:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:54,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236166501] [2022-07-19 20:28:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:54,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 20:28:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:28:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 20:28:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236166501] [2022-07-19 20:28:54,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236166501] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:28:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223111818] [2022-07-19 20:28:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:54,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:28:54,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:28:54,294 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-19 20:28:54,317 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-19 20:28:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:54,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 20:28:54,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:28:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:54,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:28:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 20:28:54,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223111818] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 20:28:54,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 20:28:54,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-07-19 20:28:54,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187841712] [2022-07-19 20:28:54,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:54,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:28:54,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:28:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:28:54,555 INFO L87 Difference]: Start difference. First operand 2093 states and 2712 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 20:28:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:54,792 INFO L93 Difference]: Finished difference Result 2149 states and 2780 transitions. [2022-07-19 20:28:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 20:28:54,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-07-19 20:28:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:54,801 INFO L225 Difference]: With dead ends: 2149 [2022-07-19 20:28:54,801 INFO L226 Difference]: Without dead ends: 2146 [2022-07-19 20:28:54,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:28:54,803 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 399 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:54,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 328 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 20:28:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2022-07-19 20:28:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2092. [2022-07-19 20:28:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-07-19 20:28:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2709 transitions. [2022-07-19 20:28:54,940 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2709 transitions. Word has length 68 [2022-07-19 20:28:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:54,941 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 2709 transitions. [2022-07-19 20:28:54,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 20:28:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2709 transitions. [2022-07-19 20:28:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-19 20:28:54,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:54,943 INFO L195 NwaCegarLoop]: trace histogram [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-19 20:28:54,973 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-19 20:28:55,159 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,SelfDestructingSolverStorable16 [2022-07-19 20:28:55,160 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1574463180, now seen corresponding path program 1 times [2022-07-19 20:28:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:55,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746418149] [2022-07-19 20:28:55,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 20:28:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 20:28:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 20:28:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746418149] [2022-07-19 20:28:55,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746418149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:28:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286307797] [2022-07-19 20:28:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:55,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:28:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:28:55,222 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-19 20:28:55,224 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-19 20:28:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:55,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 20:28:55,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:28:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 20:28:55,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 20:28:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 20:28:55,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286307797] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 20:28:55,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 20:28:55,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-07-19 20:28:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698005996] [2022-07-19 20:28:55,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 20:28:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 20:28:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 20:28:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:28:55,550 INFO L87 Difference]: Start difference. First operand 2092 states and 2709 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 20:28:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:56,591 INFO L93 Difference]: Finished difference Result 3792 states and 4929 transitions. [2022-07-19 20:28:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-19 20:28:56,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-07-19 20:28:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:56,605 INFO L225 Difference]: With dead ends: 3792 [2022-07-19 20:28:56,605 INFO L226 Difference]: Without dead ends: 3248 [2022-07-19 20:28:56,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 20:28:56,609 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 636 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:56,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 2241 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:28:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2022-07-19 20:28:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2481. [2022-07-19 20:28:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2022-07-19 20:28:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3197 transitions. [2022-07-19 20:28:56,794 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3197 transitions. Word has length 69 [2022-07-19 20:28:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:56,795 INFO L495 AbstractCegarLoop]: Abstraction has 2481 states and 3197 transitions. [2022-07-19 20:28:56,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 20:28:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3197 transitions. [2022-07-19 20:28:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 20:28:56,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:56,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:28:56,827 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-19 20:28:57,024 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,SelfDestructingSolverStorable17 [2022-07-19 20:28:57,025 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1815627380, now seen corresponding path program 1 times [2022-07-19 20:28:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:57,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103805208] [2022-07-19 20:28:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:28:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 20:28:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 20:28:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 20:28:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:57,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103805208] [2022-07-19 20:28:57,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103805208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:28:57,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357254155] [2022-07-19 20:28:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:57,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:28:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:28:57,086 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-19 20:28:57,087 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-19 20:28:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 20:28:57,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:28:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 20:28:57,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:28:57,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357254155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:57,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:28:57,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-19 20:28:57,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83902228] [2022-07-19 20:28:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:57,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:28:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:57,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:28:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:57,188 INFO L87 Difference]: Start difference. First operand 2481 states and 3197 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 20:28:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:57,325 INFO L93 Difference]: Finished difference Result 3204 states and 4135 transitions. [2022-07-19 20:28:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:28:57,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-07-19 20:28:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:57,338 INFO L225 Difference]: With dead ends: 3204 [2022-07-19 20:28:57,338 INFO L226 Difference]: Without dead ends: 2359 [2022-07-19 20:28:57,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:57,340 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 196 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:57,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 342 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:28:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2022-07-19 20:28:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2344. [2022-07-19 20:28:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2022-07-19 20:28:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3017 transitions. [2022-07-19 20:28:57,474 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3017 transitions. Word has length 88 [2022-07-19 20:28:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:57,474 INFO L495 AbstractCegarLoop]: Abstraction has 2344 states and 3017 transitions. [2022-07-19 20:28:57,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 20:28:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3017 transitions. [2022-07-19 20:28:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 20:28:57,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:57,478 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:28:57,507 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-19 20:28:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:28:57,692 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2022-07-19 20:28:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:57,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16521176] [2022-07-19 20:28:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 20:28:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:28:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 20:28:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 20:28:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:57,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16521176] [2022-07-19 20:28:57,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16521176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:57,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:57,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:28:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568593878] [2022-07-19 20:28:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:57,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:28:57,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:28:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:57,795 INFO L87 Difference]: Start difference. First operand 2344 states and 3017 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 20:28:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:58,350 INFO L93 Difference]: Finished difference Result 5463 states and 7157 transitions. [2022-07-19 20:28:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:28:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-07-19 20:28:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:58,375 INFO L225 Difference]: With dead ends: 5463 [2022-07-19 20:28:58,375 INFO L226 Difference]: Without dead ends: 4080 [2022-07-19 20:28:58,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-07-19 20:28:58,381 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 784 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:58,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 504 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 20:28:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2022-07-19 20:28:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3682. [2022-07-19 20:28:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2022-07-19 20:28:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4767 transitions. [2022-07-19 20:28:58,623 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4767 transitions. Word has length 92 [2022-07-19 20:28:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:58,624 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4767 transitions. [2022-07-19 20:28:58,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 20:28:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4767 transitions. [2022-07-19 20:28:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 20:28:58,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:58,628 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 20:28:58,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 20:28:58,628 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2022-07-19 20:28:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:58,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835137494] [2022-07-19 20:28:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 20:28:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:28:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 20:28:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 20:28:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:58,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835137494] [2022-07-19 20:28:58,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835137494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:58,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:58,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 20:28:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637235948] [2022-07-19 20:28:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:58,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 20:28:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 20:28:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 20:28:58,672 INFO L87 Difference]: Start difference. First operand 3682 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 20:28:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:28:59,058 INFO L93 Difference]: Finished difference Result 6081 states and 7883 transitions. [2022-07-19 20:28:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:28:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2022-07-19 20:28:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:28:59,069 INFO L225 Difference]: With dead ends: 6081 [2022-07-19 20:28:59,070 INFO L226 Difference]: Without dead ends: 3360 [2022-07-19 20:28:59,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 20:28:59,077 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 301 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 20:28:59,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 476 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 20:28:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-07-19 20:28:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3048. [2022-07-19 20:28:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2528 states have (on average 1.2796677215189873) internal successors, (3235), 2579 states have internal predecessors, (3235), 292 states have call successors, (292), 188 states have call predecessors, (292), 226 states have return successors, (402), 282 states have call predecessors, (402), 291 states have call successors, (402) [2022-07-19 20:28:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3929 transitions. [2022-07-19 20:28:59,257 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3929 transitions. Word has length 92 [2022-07-19 20:28:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:28:59,257 INFO L495 AbstractCegarLoop]: Abstraction has 3048 states and 3929 transitions. [2022-07-19 20:28:59,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 20:28:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3929 transitions. [2022-07-19 20:28:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 20:28:59,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:28:59,261 INFO L195 NwaCegarLoop]: trace histogram [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-19 20:28:59,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 20:28:59,262 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:28:59,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:28:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash 172011463, now seen corresponding path program 1 times [2022-07-19 20:28:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:28:59,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539591666] [2022-07-19 20:28:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:28:59,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:28:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:28:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:28:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:28:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:28:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:28:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 20:28:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:28:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 20:28:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:28:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 20:28:59,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:28:59,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539591666] [2022-07-19 20:28:59,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539591666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:28:59,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:28:59,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 20:28:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561422562] [2022-07-19 20:28:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:28:59,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 20:28:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:28:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 20:28:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:28:59,316 INFO L87 Difference]: Start difference. First operand 3048 states and 3929 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 20:29:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:00,346 INFO L93 Difference]: Finished difference Result 6551 states and 8590 transitions. [2022-07-19 20:29:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 20:29:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2022-07-19 20:29:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:00,392 INFO L225 Difference]: With dead ends: 6551 [2022-07-19 20:29:00,392 INFO L226 Difference]: Without dead ends: 4464 [2022-07-19 20:29:00,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-07-19 20:29:00,399 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 1168 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:00,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 816 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 20:29:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2022-07-19 20:29:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4168. [2022-07-19 20:29:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 3452 states have (on average 1.2604287369640788) internal successors, (4351), 3527 states have internal predecessors, (4351), 387 states have call successors, (387), 259 states have call predecessors, (387), 327 states have return successors, (558), 383 states have call predecessors, (558), 386 states have call successors, (558) [2022-07-19 20:29:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5296 transitions. [2022-07-19 20:29:00,700 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5296 transitions. Word has length 93 [2022-07-19 20:29:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:00,701 INFO L495 AbstractCegarLoop]: Abstraction has 4168 states and 5296 transitions. [2022-07-19 20:29:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 20:29:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5296 transitions. [2022-07-19 20:29:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 20:29:00,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:00,706 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:00,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 20:29:00,708 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1890951514, now seen corresponding path program 1 times [2022-07-19 20:29:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:00,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281268379] [2022-07-19 20:29:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:00,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 20:29:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 20:29:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 20:29:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 20:29:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 20:29:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 20:29:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:00,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281268379] [2022-07-19 20:29:00,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281268379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:29:00,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534621844] [2022-07-19 20:29:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:00,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:00,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:29:00,782 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-19 20:29:00,783 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-19 20:29:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:00,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:29:00,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:29:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 20:29:00,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:29:00,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534621844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:00,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:29:00,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-19 20:29:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601158073] [2022-07-19 20:29:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:00,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:29:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:00,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:29:00,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:29:00,880 INFO L87 Difference]: Start difference. First operand 4168 states and 5296 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 20:29:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:01,128 INFO L93 Difference]: Finished difference Result 4547 states and 5764 transitions. [2022-07-19 20:29:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:29:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-07-19 20:29:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:01,147 INFO L225 Difference]: With dead ends: 4547 [2022-07-19 20:29:01,147 INFO L226 Difference]: Without dead ends: 3221 [2022-07-19 20:29:01,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:29:01,150 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 62 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 490 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-19 20:29:01,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 490 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:29:01,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2022-07-19 20:29:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3221. [2022-07-19 20:29:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2608 states have (on average 1.2626533742331287) internal successors, (3293), 2667 states have internal predecessors, (3293), 330 states have call successors, (330), 222 states have call predecessors, (330), 282 states have return successors, (466), 333 states have call predecessors, (466), 330 states have call successors, (466) [2022-07-19 20:29:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4089 transitions. [2022-07-19 20:29:01,401 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4089 transitions. Word has length 103 [2022-07-19 20:29:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:01,402 INFO L495 AbstractCegarLoop]: Abstraction has 3221 states and 4089 transitions. [2022-07-19 20:29:01,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 20:29:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4089 transitions. [2022-07-19 20:29:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 20:29:01,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:01,406 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:01,433 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-19 20:29:01,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:01,631 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 199854852, now seen corresponding path program 1 times [2022-07-19 20:29:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:01,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129230601] [2022-07-19 20:29:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:01,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:29:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:29:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:29:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:29:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:29:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 20:29:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:29:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 20:29:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 20:29:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 20:29:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:01,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129230601] [2022-07-19 20:29:01,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129230601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:01,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:29:01,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:29:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516775860] [2022-07-19 20:29:01,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:01,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:29:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:01,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:29:01,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:29:01,712 INFO L87 Difference]: Start difference. First operand 3221 states and 4089 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 20:29:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:02,597 INFO L93 Difference]: Finished difference Result 7795 states and 10213 transitions. [2022-07-19 20:29:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 20:29:02,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 135 [2022-07-19 20:29:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:02,610 INFO L225 Difference]: With dead ends: 7795 [2022-07-19 20:29:02,610 INFO L226 Difference]: Without dead ends: 4713 [2022-07-19 20:29:02,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-19 20:29:02,618 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 758 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:02,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 417 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 20:29:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2022-07-19 20:29:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4229. [2022-07-19 20:29:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4229 states, 3447 states have (on average 1.2236727589208007) internal successors, (4218), 3552 states have internal predecessors, (4218), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2022-07-19 20:29:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 5202 transitions. [2022-07-19 20:29:02,959 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 5202 transitions. Word has length 135 [2022-07-19 20:29:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:02,959 INFO L495 AbstractCegarLoop]: Abstraction has 4229 states and 5202 transitions. [2022-07-19 20:29:02,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 20:29:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 5202 transitions. [2022-07-19 20:29:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 20:29:02,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:02,964 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:02,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 20:29:02,965 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -242597663, now seen corresponding path program 2 times [2022-07-19 20:29:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:02,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317922888] [2022-07-19 20:29:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:29:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:29:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:29:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:29:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:29:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 20:29:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:29:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 20:29:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 20:29:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 20:29:03,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:03,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317922888] [2022-07-19 20:29:03,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317922888] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:29:03,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138792780] [2022-07-19 20:29:03,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 20:29:03,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:29:03,046 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-19 20:29:03,048 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-19 20:29:03,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 20:29:03,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 20:29:03,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 20:29:03,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:29:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 20:29:03,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:29:03,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138792780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:03,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:29:03,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-19 20:29:03,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683478581] [2022-07-19 20:29:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:03,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:29:03,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:03,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:29:03,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:29:03,200 INFO L87 Difference]: Start difference. First operand 4229 states and 5202 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 20:29:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:03,400 INFO L93 Difference]: Finished difference Result 7017 states and 8818 transitions. [2022-07-19 20:29:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:29:03,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-07-19 20:29:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:03,414 INFO L225 Difference]: With dead ends: 7017 [2022-07-19 20:29:03,414 INFO L226 Difference]: Without dead ends: 4105 [2022-07-19 20:29:03,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:29:03,422 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:03,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:29:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2022-07-19 20:29:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4079. [2022-07-19 20:29:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 3297 states have (on average 1.2095844707309675) internal successors, (3988), 3402 states have internal predecessors, (3988), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2022-07-19 20:29:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 4972 transitions. [2022-07-19 20:29:03,681 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 4972 transitions. Word has length 135 [2022-07-19 20:29:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:03,682 INFO L495 AbstractCegarLoop]: Abstraction has 4079 states and 4972 transitions. [2022-07-19 20:29:03,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 20:29:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 4972 transitions. [2022-07-19 20:29:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 20:29:03,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:03,687 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:03,714 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-19 20:29:03,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-19 20:29:03,904 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 652625369, now seen corresponding path program 1 times [2022-07-19 20:29:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:03,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10593893] [2022-07-19 20:29:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:29:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:29:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:29:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:29:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:29:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 20:29:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:29:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 20:29:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 20:29:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-19 20:29:03,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:03,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10593893] [2022-07-19 20:29:03,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10593893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:03,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:29:03,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 20:29:03,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204981530] [2022-07-19 20:29:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:03,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:29:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:03,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:29:03,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 20:29:03,999 INFO L87 Difference]: Start difference. First operand 4079 states and 4972 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 20:29:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:04,897 INFO L93 Difference]: Finished difference Result 11890 states and 14610 transitions. [2022-07-19 20:29:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 20:29:04,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-07-19 20:29:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:04,923 INFO L225 Difference]: With dead ends: 11890 [2022-07-19 20:29:04,923 INFO L226 Difference]: Without dead ends: 8818 [2022-07-19 20:29:04,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-19 20:29:04,934 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 541 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:04,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 506 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 20:29:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8818 states. [2022-07-19 20:29:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8818 to 7140. [2022-07-19 20:29:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7140 states, 5815 states have (on average 1.2257953568357696) internal successors, (7128), 5993 states have internal predecessors, (7128), 662 states have call successors, (662), 483 states have call predecessors, (662), 662 states have return successors, (1008), 665 states have call predecessors, (1008), 662 states have call successors, (1008) [2022-07-19 20:29:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7140 states to 7140 states and 8798 transitions. [2022-07-19 20:29:05,476 INFO L78 Accepts]: Start accepts. Automaton has 7140 states and 8798 transitions. Word has length 136 [2022-07-19 20:29:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:05,476 INFO L495 AbstractCegarLoop]: Abstraction has 7140 states and 8798 transitions. [2022-07-19 20:29:05,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 20:29:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7140 states and 8798 transitions. [2022-07-19 20:29:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-19 20:29:05,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:05,484 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:05,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 20:29:05,484 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1255313462, now seen corresponding path program 1 times [2022-07-19 20:29:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:05,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868154028] [2022-07-19 20:29:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:29:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:29:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:29:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:29:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:29:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 20:29:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 20:29:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 20:29:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 20:29:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 20:29:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 20:29:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 20:29:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 20:29:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 20:29:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-19 20:29:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:05,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868154028] [2022-07-19 20:29:05,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868154028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:29:05,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064806582] [2022-07-19 20:29:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:05,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:05,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:29:05,564 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-19 20:29:05,590 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-19 20:29:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:05,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 20:29:05,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:29:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 20:29:05,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:29:05,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064806582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:05,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:29:05,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-07-19 20:29:05,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35988252] [2022-07-19 20:29:05,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:05,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 20:29:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 20:29:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:29:05,700 INFO L87 Difference]: Start difference. First operand 7140 states and 8798 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 20:29:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:06,060 INFO L93 Difference]: Finished difference Result 10848 states and 13407 transitions. [2022-07-19 20:29:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 20:29:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2022-07-19 20:29:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:06,073 INFO L225 Difference]: With dead ends: 10848 [2022-07-19 20:29:06,073 INFO L226 Difference]: Without dead ends: 3722 [2022-07-19 20:29:06,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 20:29:06,090 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 31 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:06,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 680 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:29:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-07-19 20:29:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3450. [2022-07-19 20:29:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2842 states have (on average 1.2149894440534834) internal successors, (3453), 2891 states have internal predecessors, (3453), 308 states have call successors, (308), 213 states have call predecessors, (308), 299 states have return successors, (471), 345 states have call predecessors, (471), 308 states have call successors, (471) [2022-07-19 20:29:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4232 transitions. [2022-07-19 20:29:06,356 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4232 transitions. Word has length 159 [2022-07-19 20:29:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:06,356 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 4232 transitions. [2022-07-19 20:29:06,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 20:29:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4232 transitions. [2022-07-19 20:29:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-19 20:29:06,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:06,361 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:06,390 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-19 20:29:06,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-19 20:29:06,580 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash -790442704, now seen corresponding path program 1 times [2022-07-19 20:29:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:06,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40624413] [2022-07-19 20:29:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:29:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:29:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:29:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:29:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:29:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 20:29:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 20:29:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 20:29:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 20:29:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 20:29:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 20:29:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 20:29:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 20:29:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-19 20:29:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-19 20:29:06,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:06,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40624413] [2022-07-19 20:29:06,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40624413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:06,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 20:29:06,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 20:29:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679386591] [2022-07-19 20:29:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:06,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 20:29:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:06,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 20:29:06,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 20:29:06,655 INFO L87 Difference]: Start difference. First operand 3450 states and 4232 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-19 20:29:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:07,175 INFO L93 Difference]: Finished difference Result 6175 states and 7543 transitions. [2022-07-19 20:29:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 20:29:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 163 [2022-07-19 20:29:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:07,183 INFO L225 Difference]: With dead ends: 6175 [2022-07-19 20:29:07,183 INFO L226 Difference]: Without dead ends: 2985 [2022-07-19 20:29:07,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-07-19 20:29:07,189 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 613 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:07,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 333 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 20:29:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2022-07-19 20:29:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2701. [2022-07-19 20:29:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2262 states have (on average 1.1923076923076923) internal successors, (2697), 2275 states have internal predecessors, (2697), 231 states have call successors, (231), 164 states have call predecessors, (231), 207 states have return successors, (314), 261 states have call predecessors, (314), 231 states have call successors, (314) [2022-07-19 20:29:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3242 transitions. [2022-07-19 20:29:07,382 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3242 transitions. Word has length 163 [2022-07-19 20:29:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:07,383 INFO L495 AbstractCegarLoop]: Abstraction has 2701 states and 3242 transitions. [2022-07-19 20:29:07,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-19 20:29:07,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3242 transitions. [2022-07-19 20:29:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-19 20:29:07,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:07,386 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:07,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 20:29:07,386 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1045972563, now seen corresponding path program 1 times [2022-07-19 20:29:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:07,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524176797] [2022-07-19 20:29:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:29:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:29:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:29:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:29:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:29:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 20:29:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 20:29:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 20:29:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 20:29:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 20:29:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 20:29:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 20:29:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 20:29:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 20:29:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-19 20:29:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:07,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524176797] [2022-07-19 20:29:07,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524176797] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:29:07,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924412705] [2022-07-19 20:29:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:07,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:29:07,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:29:07,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 20:29:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:07,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 20:29:07,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:29:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 20:29:07,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:29:07,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924412705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:07,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:29:07,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2022-07-19 20:29:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047363500] [2022-07-19 20:29:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:07,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 20:29:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 20:29:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 20:29:07,738 INFO L87 Difference]: Start difference. First operand 2701 states and 3242 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 20:29:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:07,902 INFO L93 Difference]: Finished difference Result 4595 states and 5560 transitions. [2022-07-19 20:29:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 20:29:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-07-19 20:29:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:07,909 INFO L225 Difference]: With dead ends: 4595 [2022-07-19 20:29:07,909 INFO L226 Difference]: Without dead ends: 2020 [2022-07-19 20:29:07,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 20:29:07,914 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:07,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 178 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 20:29:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2022-07-19 20:29:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1549. [2022-07-19 20:29:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1294 states have (on average 1.1452859350850078) internal successors, (1482), 1308 states have internal predecessors, (1482), 124 states have call successors, (124), 104 states have call predecessors, (124), 130 states have return successors, (168), 136 states have call predecessors, (168), 124 states have call successors, (168) [2022-07-19 20:29:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1774 transitions. [2022-07-19 20:29:08,045 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1774 transitions. Word has length 164 [2022-07-19 20:29:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:08,045 INFO L495 AbstractCegarLoop]: Abstraction has 1549 states and 1774 transitions. [2022-07-19 20:29:08,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 20:29:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1774 transitions. [2022-07-19 20:29:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-19 20:29:08,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 20:29:08,048 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:29:08,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 20:29:08,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:08,264 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 20:29:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 20:29:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash 239124213, now seen corresponding path program 1 times [2022-07-19 20:29:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 20:29:08,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862032945] [2022-07-19 20:29:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 20:29:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 20:29:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 20:29:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 20:29:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 20:29:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 20:29:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 20:29:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 20:29:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 20:29:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 20:29:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 20:29:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 20:29:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 20:29:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-19 20:29:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 20:29:08,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862032945] [2022-07-19 20:29:08,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862032945] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 20:29:08,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369219796] [2022-07-19 20:29:08,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 20:29:08,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 20:29:08,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 20:29:08,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 20:29:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 20:29:08,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 20:29:08,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 20:29:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-19 20:29:08,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 20:29:08,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369219796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 20:29:08,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 20:29:08,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-19 20:29:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287534931] [2022-07-19 20:29:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 20:29:08,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 20:29:08,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 20:29:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 20:29:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:29:08,439 INFO L87 Difference]: Start difference. First operand 1549 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 20:29:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 20:29:08,511 INFO L93 Difference]: Finished difference Result 2085 states and 2411 transitions. [2022-07-19 20:29:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 20:29:08,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 175 [2022-07-19 20:29:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 20:29:08,512 INFO L225 Difference]: With dead ends: 2085 [2022-07-19 20:29:08,512 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 20:29:08,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 20:29:08,515 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 96 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 20:29:08,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 20:29:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 20:29:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 20:29:08,516 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-19 20:29:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 20:29:08,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2022-07-19 20:29:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 20:29:08,518 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 20:29:08,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 20:29:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 20:29:08,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 20:29:08,520 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-19 20:29:08,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-19 20:29:08,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 20:29:08,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 20:29:08,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 20:29:23,393 WARN L233 SmtUtils]: Spent 14.00s on a formula simplification. DAG size of input: 143 DAG size of output: 139 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:29:34,811 WARN L233 SmtUtils]: Spent 10.70s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:29:46,678 WARN L233 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 121 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:29:57,347 WARN L233 SmtUtils]: Spent 10.65s on a formula simplification. DAG size of input: 121 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:30:07,956 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 121 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:30:20,192 WARN L233 SmtUtils]: Spent 10.54s on a formula simplification. DAG size of input: 122 DAG size of output: 121 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:30:27,435 WARN L233 SmtUtils]: Spent 7.22s on a formula simplification. DAG size of input: 120 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:30:44,746 WARN L233 SmtUtils]: Spent 13.65s on a formula simplification. DAG size of input: 146 DAG size of output: 142 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:30:56,345 WARN L233 SmtUtils]: Spent 10.87s on a formula simplification. DAG size of input: 126 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:31:08,358 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:31:19,178 WARN L233 SmtUtils]: Spent 10.82s on a formula simplification. DAG size of input: 121 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:31:30,088 WARN L233 SmtUtils]: Spent 10.56s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:31:42,462 WARN L233 SmtUtils]: Spent 10.67s on a formula simplification. DAG size of input: 125 DAG size of output: 124 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:31:49,874 WARN L233 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 20:32:07,302 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2022-07-19 20:32:07,303 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 706 716) the Hoare annotation is: (let ((.cse17 (= ~E_1~0 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~m_i~0 1))) (.cse16 (and (= |old(~t1_st~0)| ~t1_st~0) .cse1)) (.cse18 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not .cse17)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (not (= ~token~0 ~local~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 (= ~t1_st~0 0)) .cse2 .cse3 .cse4 .cse5 (not (= ~E_M~0 ~M_E~0)) (not (= ~m_pc~0 0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_pc~0 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 (= ~E_1~0 0) .cse14 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse16 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= 2 ~E_M~0)) .cse12 .cse13 .cse14 .cse15)))) [2022-07-19 20:32:07,303 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2022-07-19 20:32:07,304 INFO L895 garLoopResultBuilder]: At program point L62(lines 46 64) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse15 (not (= ~p_dw_pc~0 0))) (.cse11 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse12 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse13 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse14 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse0 (not (= ~M_E~0 2))) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (and .cse18 .cse19)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 .cse10 (and .cse11 .cse12 .cse13 .cse14) .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse15 .cse4 (and .cse18 .cse11 .cse19 .cse12 .cse13 .cse14) .cse5 (not (= ~c_num_read~0 0)) .cse16 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17)))) [2022-07-19 20:32:07,304 INFO L895 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (let ((.cse0 (not (= ~M_E~0 2))) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= 2 |old(~c_dr_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse10 .cse6 .cse7 .cse8 .cse9))) [2022-07-19 20:32:07,304 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-07-19 20:32:07,304 INFO L895 garLoopResultBuilder]: At program point L81(lines 65 83) the Hoare annotation is: (let ((.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= ~q_free~0 0))) (.cse20 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_1~0 ~M_E~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not (= ~m_st~0 0))) (.cse18 (not (= ~t1_st~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse19 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and (= ~c_dr_st~0 2) (or .cse1 .cse21)) .cse18 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse15 .cse21 (and .cse1 .cse2 .cse4 .cse7) .cse16 .cse17 .cse18 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2022-07-19 20:32:07,304 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-07-19 20:32:07,305 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2022-07-19 20:32:07,305 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-07-19 20:32:07,305 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2022-07-19 20:32:07,305 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-07-19 20:32:07,305 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2022-07-19 20:32:07,305 INFO L895 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse10 (not (= ~p_dw_pc~0 0))) (.cse13 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse15 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse0 (not (= ~M_E~0 2))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (and .cse12 .cse14)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse10 .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse11 (and .cse12 .cse13 .cse14 .cse15) .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse2 .cse3 .cse10 .cse4 (and .cse13 .cse15) .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse17) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse17)))) [2022-07-19 20:32:07,305 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-07-19 20:32:07,306 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2022-07-19 20:32:07,306 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-07-19 20:32:07,306 INFO L895 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= ~q_free~0 0))) (.cse20 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_1~0 ~M_E~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not (= ~m_st~0 0))) (.cse18 (not (= ~t1_st~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse19 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and (= ~c_dr_st~0 2) (or .cse1 .cse21)) .cse18 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse15 .cse21 (and .cse1 .cse2 .cse4 .cse7) .cse16 .cse17 .cse18 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2022-07-19 20:32:07,306 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-07-19 20:32:07,306 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2022-07-19 20:32:07,306 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2022-07-19 20:32:07,307 INFO L899 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2022-07-19 20:32:07,307 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 625 652) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse11 (= ~m_st~0 0)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse11) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse12 (not (= ~token~0 ~local~0))) (or .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse11 (not (= ~t1_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~M_E~0 |old(~M_E~0)|) .cse0 (= ~E_M~0 |old(~E_M~0)|) .cse1) .cse10 (not (<= 2 |old(~E_M~0)|)) (= |old(~E_1~0)| 1) (= |old(~E_1~0)| 0) .cse12))) [2022-07-19 20:32:07,307 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2022-07-19 20:32:07,307 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2022-07-19 20:32:07,307 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 681 705) the Hoare annotation is: (let ((.cse22 (= ~E_1~0 1)) (.cse26 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (and .cse26 (= ~t1_st~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= ~m_pc~0 0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse25 (= ~E_1~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (= |old(~m_st~0)| 0)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (= ~m_i~0 1))) (.cse21 (and (= |old(~t1_st~0)| ~t1_st~0) .cse26)) (.cse23 (not (= ~t1_pc~0 1))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~c_num_read~0 0))) (.cse15 (not (= ~q_free~0 0))) (.cse24 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not .cse22)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_1~0 ~M_E~0)) .cse16 (not .cse5) .cse18 .cse19) (or .cse1 .cse4 .cse5 .cse20 .cse6 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24 .cse25 .cse18) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 (not (< ~local~0 ~token~0)) .cse16 .cse25 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19)))) [2022-07-19 20:32:07,308 INFO L895 garLoopResultBuilder]: At program point L506(lines 490 508) the Hoare annotation is: (let ((.cse23 (<= |activate_threads2_is_master_triggered_#res#1| 0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse25 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse27 (<= 0 |activate_threads2_is_master_triggered_#res#1|)) (.cse29 (= ~E_1~0 1))) (let ((.cse16 (not .cse29)) (.cse19 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse21 (not (= ~m_pc~0 0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse18 (not (= ~token~0 ~local~0))) (.cse2 (not (= ~M_E~0 2))) (.cse15 (not (= ~T1_E~0 ~M_E~0))) (.cse0 (and .cse23 .cse28 .cse24 .cse25 .cse26 .cse27)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (= ~m_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (<= 2 ~E_M~0))) (.cse30 (= ~E_1~0 0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse1 .cse2 .cse3 .cse6 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 (and .cse23 .cse24 .cse25 (= ~t1_st~0 0) .cse26 .cse27) (not (= ~E_1~0 ~M_E~0)) .cse15 (not .cse4) .cse17 .cse18) (or .cse1 .cse2 .cse3 .cse4 .cse6 (and .cse28 .cse25) .cse29 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse15 .cse30 .cse17 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse17)))) [2022-07-19 20:32:07,308 INFO L899 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2022-07-19 20:32:07,308 INFO L895 garLoopResultBuilder]: At program point L525(lines 509 527) the Hoare annotation is: (let ((.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= ~q_free~0 0)) (.cse24 (= ~c_num_read~0 0)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~p_dw_pc~0 0)) (.cse25 (= ~t1_i~0 1)) (.cse22 (= ~p_num_write~0 0)) (.cse31 (= ~m_i~0 1)) (.cse34 (= ~c_dr_pc~0 0)) (.cse32 (= ~p_dw_st~0 0)) (.cse21 (= ~T1_E~0 ~M_E~0)) (.cse38 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse33 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse36 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse37 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse39 (= ~E_1~0 1))) (let ((.cse17 (not .cse39)) (.cse23 (<= 1 ~t1_pc~0)) (.cse28 (= ~m_st~0 0)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not (= ~M_E~0 2))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse12 (and .cse38 .cse30 (= ~t1_st~0 0) .cse33 .cse36 .cse37)) (.cse13 (not (= ~t1_pc~0 0))) (.cse16 (not .cse21)) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not .cse32)) (.cse3 (not .cse34)) (.cse4 (= |old(~m_st~0)| 0)) (.cse42 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not .cse31)) (.cse40 (not (= ~t1_pc~0 1))) (.cse8 (not .cse22)) (.cse9 (not .cse25)) (.cse10 (not .cse20)) (.cse11 (not .cse26)) (.cse14 (not .cse24)) (.cse15 (not .cse29)) (.cse43 (not (<= 2 ~E_M~0))) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (= ~E_1~0 0)) (.cse18 (not .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse1 .cse2 .cse3 .cse4 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse38 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse5 .cse39 .cse40 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 (not (< ~local~0 ~token~0)) .cse16 .cse41 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse3 .cse4 .cse42 .cse5 .cse40 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse43 .cse16 .cse17 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse38 .cse29 .cse31 .cse32 .cse34 .cse35) .cse18 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse34 .cse35) .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse42 .cse5 .cse40 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse43 .cse16 (not .cse28) .cse41 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_1~0 ~M_E~0)) .cse16 (not .cse4) .cse18 .cse19) (or .cse1 .cse3 .cse4 .cse42 .cse5 .cse39 .cse40 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse43 (and .cse27 .cse38 .cse30 .cse33 .cse36 .cse37) .cse41 .cse18)))) [2022-07-19 20:32:07,308 INFO L899 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2022-07-19 20:32:07,309 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2022-07-19 20:32:07,309 INFO L899 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2022-07-19 20:32:07,309 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2022-07-19 20:32:07,309 INFO L895 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse23 (= ~E_1~0 1)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (let ((.cse26 (= ~E_1~0 0)) (.cse22 (not (<= 2 |old(~t1_st~0)|))) (.cse24 (not (= ~t1_pc~0 1))) (.cse25 (not (<= 2 ~E_M~0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse21 (and .cse27 .cse17 .cse18 .cse19)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse15 (= |old(~m_st~0)| 0)) (.cse4 (not (= ~m_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~t1_pc~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (= ~T1_E~0 ~M_E~0))) (.cse28 (not .cse23)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~E_1~0 ~M_E~0)) .cse14 (not .cse15) .cse16 (and .cse17 .cse18 (= ~t1_st~0 0) .cse19) .cse20) (or .cse1 .cse21 .cse3 .cse15 .cse22 .cse4 .cse23 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 .cse26 .cse16) (or .cse1 .cse2 .cse3 .cse15 .cse4 (and .cse27 .cse18) .cse23 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse14 .cse26 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse21 .cse3 .cse15 .cse22 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 .cse14 .cse28 .cse16 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse16 .cse20)))) [2022-07-19 20:32:07,309 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2022-07-19 20:32:07,309 INFO L899 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2022-07-19 20:32:07,310 INFO L899 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2022-07-19 20:32:07,310 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2022-07-19 20:32:07,310 INFO L899 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2022-07-19 20:32:07,310 INFO L895 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse42 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~m_st~0 |old(~m_st~0)|)) (.cse32 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse35 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse31 (= ~q_free~0 0)) (.cse26 (= ~c_num_read~0 0)) (.cse28 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~p_dw_pc~0 0)) (.cse27 (= ~t1_i~0 1)) (.cse24 (= ~p_num_write~0 0)) (.cse33 (= ~m_i~0 1)) (.cse36 (= ~c_dr_pc~0 0)) (.cse34 (= ~p_dw_st~0 0)) (.cse23 (= ~T1_E~0 ~M_E~0)) (.cse37 (= ~M_E~0 2)) (.cse20 (= ~E_1~0 1))) (let ((.cse30 (= ~m_st~0 0)) (.cse17 (not .cse20)) (.cse25 (<= 1 ~t1_pc~0)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not .cse37)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse12 (not (= ~t1_pc~0 0))) (.cse15 (not .cse23)) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not .cse34)) (.cse3 (not .cse36)) (.cse4 (= |old(~m_st~0)| 0)) (.cse40 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not .cse33)) (.cse21 (not (= ~t1_pc~0 1))) (.cse8 (not .cse24)) (.cse9 (not .cse27)) (.cse10 (not .cse22)) (.cse11 (not .cse28)) (.cse13 (not .cse26)) (.cse14 (not .cse31)) (.cse41 (not (<= 2 ~E_M~0))) (.cse16 (and .cse29 .cse38 .cse32 .cse35)) (.cse39 (= ~E_1~0 0)) (.cse18 (not .cse42))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse21 .cse8 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse9 .cse10 .cse11 .cse13 .cse14 (not (< ~local~0 ~token~0)) (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse38 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse15 .cse39 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse41 .cse15 (not .cse30) .cse39 .cse18 .cse19) (or (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse36 .cse42 .cse37) .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse41 .cse15 .cse17 .cse18 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse38 .cse31 .cse33 .cse34 .cse36 .cse42 .cse37) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~E_1~0 ~M_E~0)) (and .cse38 .cse32 (= ~t1_st~0 0) .cse35) .cse15 (not .cse4) .cse18 .cse19) (or .cse1 .cse3 .cse4 .cse40 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse41 .cse16 .cse39 .cse18)))) [2022-07-19 20:32:07,310 INFO L899 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2022-07-19 20:32:07,310 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2022-07-19 20:32:07,311 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2022-07-19 20:32:07,311 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,311 INFO L895 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,311 INFO L895 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0))) (let ((.cse5 (= ~t1_pc~0 0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (not .cse8)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_1~0 0))) (.cse17 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~m_i~0 1)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse11 .cse12 .cse22 .cse23 .cse13 .cse15 (< ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15) (and .cse19 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse18)))) [2022-07-19 20:32:07,311 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 20:32:07,312 INFO L895 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-07-19 20:32:07,312 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-07-19 20:32:07,312 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2022-07-19 20:32:07,312 INFO L899 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2022-07-19 20:32:07,312 INFO L895 garLoopResultBuilder]: At program point L780(lines 764 782) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,312 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-07-19 20:32:07,313 INFO L895 garLoopResultBuilder]: At program point L483(lines 454 489) the Hoare annotation is: (let ((.cse12 (not (= ~E_1~0 1))) (.cse13 (not (= ~E_1~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< ~local~0 ~token~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~m_st~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~E_1~0 ~M_E~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) .cse11 .cse14 (= ~m_pc~0 0) .cse15 .cse16))) [2022-07-19 20:32:07,313 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-07-19 20:32:07,313 INFO L895 garLoopResultBuilder]: At program point L318(lines 302 320) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-07-19 20:32:07,313 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2022-07-19 20:32:07,313 INFO L895 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_pc~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_dw_st~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~p_dw_st~0) .cse14))) [2022-07-19 20:32:07,314 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-07-19 20:32:07,314 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-07-19 20:32:07,314 INFO L899 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2022-07-19 20:32:07,314 INFO L895 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,314 INFO L895 garLoopResultBuilder]: At program point L798-1(lines 795 835) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse5 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 (= ~T1_E~0 ~M_E~0) .cse1 (= ~E_1~0 ~M_E~0) .cse2 (= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 (not .cse5) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) .cse9 .cse10))) [2022-07-19 20:32:07,314 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,314 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-07-19 20:32:07,315 INFO L899 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2022-07-19 20:32:07,315 INFO L895 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~p_dw_st~0) .cse11))) [2022-07-19 20:32:07,315 INFO L899 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-07-19 20:32:07,315 INFO L895 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse18 (<= 1 ~t1_pc~0)) (.cse12 (= ~T1_E~0 ~M_E~0)) (.cse14 (= ~t1_pc~0 0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse11 (= ~M_E~0 2))) (let ((.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse10 (or (and .cse12 .cse18 .cse15 .cse16 .cse17 .cse11) (and .cse12 .cse14 .cse15 .cse16 .cse17 .cse11))) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_free~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 (< ~local~0 ~token~0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 0) .cse9 .cse11 (let ((.cse13 (= ~E_1~0 ~M_E~0))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse12 .cse18 .cse13 .cse15 .cse16 .cse17))))))) [2022-07-19 20:32:07,315 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-07-19 20:32:07,315 INFO L899 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2022-07-19 20:32:07,316 INFO L899 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-07-19 20:32:07,316 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-07-19 20:32:07,316 INFO L899 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2022-07-19 20:32:07,316 INFO L899 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2022-07-19 20:32:07,316 INFO L895 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 20:32:07,316 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-07-19 20:32:07,317 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-07-19 20:32:07,317 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2022-07-19 20:32:07,317 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-07-19 20:32:07,317 INFO L895 garLoopResultBuilder]: At program point L851(lines 842 853) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-07-19 20:32:07,317 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-07-19 20:32:07,317 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 1)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~c_dr_st~0 2)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse11 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 0) .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse7 .cse8 .cse9 .cse10))) [2022-07-19 20:32:07,318 INFO L895 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0))) (let ((.cse5 (= ~t1_pc~0 0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (not .cse8)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_1~0 0))) (.cse17 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~m_i~0 1)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse11 .cse12 .cse22 .cse23 .cse13 .cse15 (< ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15) (and .cse19 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse18)))) [2022-07-19 20:32:07,318 INFO L895 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 1))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) .cse15) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-19 20:32:07,318 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7 (= ~p_num_write~0 1) .cse8 .cse9))) [2022-07-19 20:32:07,318 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2022-07-19 20:32:07,318 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2022-07-19 20:32:07,318 INFO L895 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-07-19 20:32:07,319 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2022-07-19 20:32:07,319 INFO L895 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,319 INFO L899 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2022-07-19 20:32:07,319 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-07-19 20:32:07,319 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-07-19 20:32:07,319 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2022-07-19 20:32:07,319 INFO L895 garLoopResultBuilder]: At program point L391(lines 386 393) the Hoare annotation is: false [2022-07-19 20:32:07,320 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2022-07-19 20:32:07,320 INFO L895 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-07-19 20:32:07,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 20:32:07,320 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2022-07-19 20:32:07,320 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2022-07-19 20:32:07,320 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2022-07-19 20:32:07,320 INFO L895 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,321 INFO L899 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2022-07-19 20:32:07,321 INFO L899 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2022-07-19 20:32:07,321 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2022-07-19 20:32:07,321 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-07-19 20:32:07,321 INFO L899 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2022-07-19 20:32:07,321 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-07-19 20:32:07,321 INFO L895 garLoopResultBuilder]: At program point L161(lines 156 208) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,322 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2022-07-19 20:32:07,322 INFO L902 garLoopResultBuilder]: At program point L376(lines 367 378) the Hoare annotation is: true [2022-07-19 20:32:07,322 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2022-07-19 20:32:07,322 INFO L895 garLoopResultBuilder]: At program point L723(lines 717 725) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,322 INFO L899 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-07-19 20:32:07,322 INFO L895 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,322 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2022-07-19 20:32:07,323 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2022-07-19 20:32:07,323 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2022-07-19 20:32:07,323 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2022-07-19 20:32:07,323 INFO L902 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2022-07-19 20:32:07,323 INFO L895 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-07-19 20:32:07,323 INFO L895 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,323 INFO L899 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2022-07-19 20:32:07,324 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-07-19 20:32:07,324 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2022-07-19 20:32:07,324 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-07-19 20:32:07,324 INFO L895 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-07-19 20:32:07,324 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 20:32:07,324 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-07-19 20:32:07,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-07-19 20:32:07,325 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2022-07-19 20:32:07,325 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2022-07-19 20:32:07,325 INFO L895 garLoopResultBuilder]: At program point L462(lines 457 488) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,325 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,325 INFO L895 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,325 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-07-19 20:32:07,326 INFO L895 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,326 INFO L895 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,326 INFO L895 garLoopResultBuilder]: At program point L364(lines 350 366) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,326 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,326 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-07-19 20:32:07,326 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-07-19 20:32:07,327 INFO L895 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,327 INFO L895 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~E_M~0 ~M_E~0) .cse18 .cse19))) [2022-07-19 20:32:07,327 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2022-07-19 20:32:07,327 INFO L895 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,327 INFO L895 garLoopResultBuilder]: At program point L761(lines 754 763) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-19 20:32:07,327 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-07-19 20:32:07,328 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~E_1~0 1)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13 (= ~E_M~0 ~M_E~0) .cse14 .cse15))) [2022-07-19 20:32:07,328 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2022-07-19 20:32:07,328 INFO L899 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2022-07-19 20:32:07,328 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,328 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-07-19 20:32:07,328 INFO L895 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-19 20:32:07,329 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 0) .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 (= ~q_free~0 0) .cse7 .cse8 .cse10 .cse11 .cse12))) [2022-07-19 20:32:07,329 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 228 247) no Hoare annotation was computed. [2022-07-19 20:32:07,329 INFO L902 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: true [2022-07-19 20:32:07,329 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2022-07-19 20:32:07,329 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2022-07-19 20:32:07,329 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2022-07-19 20:32:07,329 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2022-07-19 20:32:07,329 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-07-19 20:32:07,330 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-07-19 20:32:07,330 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2022-07-19 20:32:07,330 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-07-19 20:32:07,330 INFO L895 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0))) (let ((.cse5 (= ~E_1~0 1)) (.cse17 (= ~E_1~0 0)) (.cse20 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse13 (not (<= 2 ~E_M~0))) (.cse21 (not .cse4)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse22 (not (= ~E_M~0 ~M_E~0))) (.cse24 (not (= ~m_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse25 (not (= ~E_1~0 ~M_E~0))) (.cse14 (not (= ~T1_E~0 ~M_E~0))) (.cse15 (<= 1 exists_runnable_thread2_~__retres1~6)) (.cse16 (not (= ~t1_st~0 0))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse14 .cse21 .cse15 .cse17 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse21 .cse15 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse24 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse25 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2022-07-19 20:32:07,330 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 554 573) no Hoare annotation was computed. [2022-07-19 20:32:07,330 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2022-07-19 20:32:07,330 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2022-07-19 20:32:07,331 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2022-07-19 20:32:07,331 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2022-07-19 20:32:07,331 INFO L899 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2022-07-19 20:32:07,331 INFO L899 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2022-07-19 20:32:07,331 INFO L899 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2022-07-19 20:32:07,331 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2022-07-19 20:32:07,331 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 653 680) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse11 (= ~m_st~0 0)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse11) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse12 (not (= ~token~0 ~local~0))) (or .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse11 (not (= ~t1_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~M_E~0 |old(~M_E~0)|) .cse0 (= ~E_M~0 |old(~E_M~0)|) .cse1) .cse10 (not (<= 2 |old(~E_M~0)|)) (= |old(~E_1~0)| 1) (= |old(~E_1~0)| 0) .cse12))) [2022-07-19 20:32:07,332 INFO L899 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2022-07-19 20:32:07,334 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 20:32:07,336 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 20:32:07,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 08:32:07 BoogieIcfgContainer [2022-07-19 20:32:07,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 20:32:07,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 20:32:07,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 20:32:07,400 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 20:32:07,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 08:28:44" (3/4) ... [2022-07-19 20:32:07,403 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 20:32:07,408 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-07-19 20:32:07,408 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-07-19 20:32:07,408 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-07-19 20:32:07,408 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-07-19 20:32:07,408 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-07-19 20:32:07,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-07-19 20:32:07,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-07-19 20:32:07,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-07-19 20:32:07,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-07-19 20:32:07,417 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-07-19 20:32:07,418 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 20:32:07,419 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 20:32:07,419 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 20:32:07,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local)) && ((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) [2022-07-19 20:32:07,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write)) [2022-07-19 20:32:07,441 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || E_1 == 0) || !(c_last_read == p_last_write)) [2022-07-19 20:32:07,442 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write)) [2022-07-19 20:32:07,443 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) [2022-07-19 20:32:07,443 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) [2022-07-19 20:32:07,443 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2022-07-19 20:32:07,443 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2022-07-19 20:32:07,489 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 20:32:07,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 20:32:07,490 INFO L158 Benchmark]: Toolchain (without parser) took 203641.21ms. Allocated memory was 102.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 70.1MB in the beginning and 857.8MB in the end (delta: -787.6MB). Peak memory consumption was 526.8MB. Max. memory is 16.1GB. [2022-07-19 20:32:07,492 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 102.8MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 20:32:07,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.87ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 72.6MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 20:32:07,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.59ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 69.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 20:32:07,494 INFO L158 Benchmark]: Boogie Preprocessor took 27.77ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 20:32:07,498 INFO L158 Benchmark]: RCFGBuilder took 541.67ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 67.7MB in the beginning and 96.7MB in the end (delta: -29.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-07-19 20:32:07,500 INFO L158 Benchmark]: TraceAbstraction took 202614.88ms. Allocated memory was 123.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 96.1MB in the beginning and 866.1MB in the end (delta: -770.1MB). Peak memory consumption was 865.4MB. Max. memory is 16.1GB. [2022-07-19 20:32:07,500 INFO L158 Benchmark]: Witness Printer took 90.01ms. Allocated memory is still 1.4GB. Free memory was 866.1MB in the beginning and 857.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 20:32:07,501 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.20ms. Allocated memory is still 102.8MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.87ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 72.6MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.59ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 69.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.77ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 541.67ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 67.7MB in the beginning and 96.7MB in the end (delta: -29.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 202614.88ms. Allocated memory was 123.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 96.1MB in the beginning and 866.1MB in the end (delta: -770.1MB). Peak memory consumption was 865.4MB. Max. memory is 16.1GB. * Witness Printer took 90.01ms. Allocated memory is still 1.4GB. Free memory was 866.1MB in the beginning and 857.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 10 procedures, 179 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 202.5s, OverallIterations: 30, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 178.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11642 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11340 mSDsluCounter, 19252 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12095 mSDsCounter, 2326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9538 IncrementalHoareTripleChecker+Invalid, 11864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2326 mSolverCounterUnsat, 7157 mSDtfsCounter, 9538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1911 GetRequests, 1579 SyntacticMatches, 3 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7140occurred in iteration=26, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 6991 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 8850 PreInvPairs, 9220 NumberOfFragments, 10317 HoareAnnotationTreeSize, 8850 FomulaSimplifications, 3674 FormulaSimplificationTreeSizeReduction, 165.2s HoareSimplificationTime, 72 FomulaSimplificationsInter, 7608949 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3523 NumberOfCodeBlocks, 3523 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3620 ConstructedInterpolants, 0 QuantifiedInterpolants, 7187 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3203 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 40 InterpolantComputations, 29 PerfectInterpolantSequences, 1590/1700 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 2 specifications checked. All of them hold - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2)) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local)) && ((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_last_read == p_last_write) && local < token) && ((((((T1_E == M_E && 1 <= t1_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2) || (((((T1_E == M_E && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2))) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_last_read == p_last_write) && ((((((T1_E == M_E && 1 <= t1_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2) || (((((T1_E == M_E && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2)))) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && 1 <= tmp) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) && ((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) || (((((T1_E == M_E && 1 <= t1_pc) && E_1 == M_E) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0))) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2)) || (((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2)) || (((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2)) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(T1_E == M_E)) || !(m_st == 0)) || 1 <= __retres1) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(E_M == M_E)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || 1 <= __retres1) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2)) || ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || ((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2)) || (((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) RESULT: Ultimate proved your program to be correct! [2022-07-19 20:32:07,577 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