./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-16 02:29:30,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:29:30,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:29:30,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:29:30,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:29:30,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:29:30,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:29:30,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:29:30,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:29:30,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:29:30,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:29:30,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:29:30,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:29:30,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:29:30,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:29:30,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:29:30,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:29:30,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:29:30,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:29:30,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:29:30,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:29:30,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:29:30,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:29:30,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:29:30,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:29:30,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:29:30,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:29:30,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:29:30,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:29:30,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:29:30,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:29:30,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:29:30,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:29:30,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:29:30,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:29:30,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:29:30,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:29:30,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:29:30,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:29:30,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:29:30,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:29:30,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:29:30,614 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:29:30,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:29:30,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:29:30,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:29:30,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:29:30,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:29:30,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:29:30,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:29:30,618 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:29:30,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:29:30,619 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:29:30,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:29:30,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:29:30,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:29:30,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:29:30,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:29:30,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:29:30,620 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:29:30,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:29:30,620 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:29:30,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:29:30,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:29:30,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:29:30,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:29:30,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:29:30,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:29:30,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:29:30,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:29:30,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:29:30,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:29:30,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:29:30,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:29:30,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:29:30,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:29:30,623 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 [2021-12-16 02:29:30,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:29:30,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:29:30,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:29:30,866 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:29:30,869 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:29:30,870 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 [2021-12-16 02:29:30,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27219d0dd/804ceaa74ae042018fdc26f95a046b00/FLAGe66a6c855 [2021-12-16 02:29:31,366 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:29:31,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-12-16 02:29:31,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27219d0dd/804ceaa74ae042018fdc26f95a046b00/FLAGe66a6c855 [2021-12-16 02:29:31,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27219d0dd/804ceaa74ae042018fdc26f95a046b00 [2021-12-16 02:29:31,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:29:31,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:29:31,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:29:31,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:29:31,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:29:31,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:31,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8d6c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31, skipping insertion in model container [2021-12-16 02:29:31,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:31,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:29:31,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:29:31,585 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] [2021-12-16 02:29:31,681 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] [2021-12-16 02:29:31,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:29:31,758 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:29:31,778 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] [2021-12-16 02:29:31,836 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] [2021-12-16 02:29:31,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:29:31,882 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:29:31,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31 WrapperNode [2021-12-16 02:29:31,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:29:31,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:29:31,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:29:31,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:29:31,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:31,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:31,988 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2021-12-16 02:29:31,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:29:31,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:29:31,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:29:31,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:29:32,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:29:32,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:29:32,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:29:32,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:29:32,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (1/1) ... [2021-12-16 02:29:32,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:29:32,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:32,098 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) [2021-12-16 02:29:32,100 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 [2021-12-16 02:29:32,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:29:32,149 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-16 02:29:32,149 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-16 02:29:32,149 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-12-16 02:29:32,152 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-12-16 02:29:32,152 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-16 02:29:32,152 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-16 02:29:32,152 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-16 02:29:32,152 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-16 02:29:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-16 02:29:32,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-16 02:29:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-16 02:29:32,153 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-16 02:29:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-16 02:29:32,154 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-16 02:29:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:29:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-16 02:29:32,154 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-16 02:29:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:29:32,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:29:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-16 02:29:32,154 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-16 02:29:32,260 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:29:32,273 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:29:32,574 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:29:32,580 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:29:32,580 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-16 02:29:32,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:29:32 BoogieIcfgContainer [2021-12-16 02:29:32,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:29:32,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:29:32,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:29:32,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:29:32,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:29:31" (1/3) ... [2021-12-16 02:29:32,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6898e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:29:32, skipping insertion in model container [2021-12-16 02:29:32,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:31" (2/3) ... [2021-12-16 02:29:32,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6898e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:29:32, skipping insertion in model container [2021-12-16 02:29:32,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:29:32" (3/3) ... [2021-12-16 02:29:32,591 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-12-16 02:29:32,594 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:29:32,595 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-16 02:29:32,642 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:29:32,650 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 02:29:32,651 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-16 02:29:32,677 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) [2021-12-16 02:29:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-16 02:29:32,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:32,688 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:32,689 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2021-12-16 02:29:32,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:32,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610880553] [2021-12-16 02:29:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:32,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:32,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-16 02:29:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:32,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:32,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610880553] [2021-12-16 02:29:32,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610880553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:32,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:32,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:32,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438696764] [2021-12-16 02:29:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:32,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:32,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:32,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:32,951 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) [2021-12-16 02:29:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:33,174 INFO L93 Difference]: Finished difference Result 414 states and 624 transitions. [2021-12-16 02:29:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:33,177 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 [2021-12-16 02:29:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:33,184 INFO L225 Difference]: With dead ends: 414 [2021-12-16 02:29:33,185 INFO L226 Difference]: Without dead ends: 239 [2021-12-16 02:29:33,188 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:33,190 INFO L933 BasicCegarLoop]: 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 [2021-12-16 02:29:33,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 471 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-16 02:29:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-12-16 02:29:33,244 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) [2021-12-16 02:29:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2021-12-16 02:29:33,246 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 44 [2021-12-16 02:29:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:33,247 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2021-12-16 02:29:33,247 INFO L471 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) [2021-12-16 02:29:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2021-12-16 02:29:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 02:29:33,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:33,250 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:33,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:29:33,251 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2021-12-16 02:29:33,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:33,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15532011] [2021-12-16 02:29:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:33,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 02:29:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:33,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:33,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15532011] [2021-12-16 02:29:33,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15532011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:33,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:33,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:33,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219720248] [2021-12-16 02:29:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:33,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:33,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:33,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:33,331 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) [2021-12-16 02:29:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:33,498 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2021-12-16 02:29:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:33,498 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 [2021-12-16 02:29:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:33,501 INFO L225 Difference]: With dead ends: 481 [2021-12-16 02:29:33,501 INFO L226 Difference]: Without dead ends: 357 [2021-12-16 02:29:33,502 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:33,503 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 148 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:33,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 585 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-12-16 02:29:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2021-12-16 02:29:33,522 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) [2021-12-16 02:29:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2021-12-16 02:29:33,524 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 45 [2021-12-16 02:29:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:33,524 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2021-12-16 02:29:33,524 INFO L471 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) [2021-12-16 02:29:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2021-12-16 02:29:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 02:29:33,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:33,526 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:33,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:29:33,527 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2021-12-16 02:29:33,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:33,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494636322] [2021-12-16 02:29:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:33,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 02:29:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:33,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:33,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494636322] [2021-12-16 02:29:33,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494636322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:33,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:33,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:33,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414499863] [2021-12-16 02:29:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:33,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:33,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:33,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:33,583 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) [2021-12-16 02:29:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:33,684 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2021-12-16 02:29:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:33,685 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 [2021-12-16 02:29:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:33,688 INFO L225 Difference]: With dead ends: 708 [2021-12-16 02:29:33,689 INFO L226 Difference]: Without dead ends: 517 [2021-12-16 02:29:33,690 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:33,691 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 293 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:33,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 464 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-12-16 02:29:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2021-12-16 02:29:33,729 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) [2021-12-16 02:29:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2021-12-16 02:29:33,731 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 45 [2021-12-16 02:29:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:33,732 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2021-12-16 02:29:33,732 INFO L471 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) [2021-12-16 02:29:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2021-12-16 02:29:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:33,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:33,734 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:33,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:29:33,735 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2021-12-16 02:29:33,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:33,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877628916] [2021-12-16 02:29:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:33,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:33,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877628916] [2021-12-16 02:29:33,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877628916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:33,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:33,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:29:33,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226292305] [2021-12-16 02:29:33,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:33,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:29:33,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:29:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:33,793 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) [2021-12-16 02:29:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:34,021 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2021-12-16 02:29:34,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:29:34,021 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 [2021-12-16 02:29:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:34,024 INFO L225 Difference]: With dead ends: 582 [2021-12-16 02:29:34,024 INFO L226 Difference]: Without dead ends: 486 [2021-12-16 02:29:34,024 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:34,025 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 263 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:34,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 527 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-12-16 02:29:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2021-12-16 02:29:34,041 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) [2021-12-16 02:29:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2021-12-16 02:29:34,043 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 57 [2021-12-16 02:29:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:34,044 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2021-12-16 02:29:34,044 INFO L471 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) [2021-12-16 02:29:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2021-12-16 02:29:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:34,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:34,046 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:34,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:29:34,046 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2021-12-16 02:29:34,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:34,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436926941] [2021-12-16 02:29:34,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:34,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:34,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436926941] [2021-12-16 02:29:34,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436926941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:34,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:34,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:29:34,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899669176] [2021-12-16 02:29:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:34,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:29:34,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:34,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:29:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:29:34,117 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) [2021-12-16 02:29:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:34,525 INFO L93 Difference]: Finished difference Result 689 states and 962 transitions. [2021-12-16 02:29:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:29:34,526 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 [2021-12-16 02:29:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:34,529 INFO L225 Difference]: With dead ends: 689 [2021-12-16 02:29:34,529 INFO L226 Difference]: Without dead ends: 596 [2021-12-16 02:29:34,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:29:34,531 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 434 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:34,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 689 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-16 02:29:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 555. [2021-12-16 02:29:34,552 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) [2021-12-16 02:29:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 763 transitions. [2021-12-16 02:29:34,554 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 763 transitions. Word has length 57 [2021-12-16 02:29:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:34,554 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 763 transitions. [2021-12-16 02:29:34,554 INFO L471 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) [2021-12-16 02:29:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 763 transitions. [2021-12-16 02:29:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:34,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:34,556 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:34,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:29:34,556 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1340236402, now seen corresponding path program 1 times [2021-12-16 02:29:34,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:34,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479784334] [2021-12-16 02:29:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:34,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:34,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:34,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479784334] [2021-12-16 02:29:34,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479784334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:34,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:34,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:34,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067820453] [2021-12-16 02:29:34,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:34,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:34,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:34,638 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) [2021-12-16 02:29:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:34,914 INFO L93 Difference]: Finished difference Result 779 states and 1090 transitions. [2021-12-16 02:29:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:29:34,915 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 [2021-12-16 02:29:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:34,917 INFO L225 Difference]: With dead ends: 779 [2021-12-16 02:29:34,917 INFO L226 Difference]: Without dead ends: 596 [2021-12-16 02:29:34,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:29:34,918 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 428 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:34,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 552 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:34,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-16 02:29:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 555. [2021-12-16 02:29:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 475 states have (on average 1.368421052631579) internal successors, (650), 483 states have internal predecessors, (650), 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) [2021-12-16 02:29:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 761 transitions. [2021-12-16 02:29:34,960 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 761 transitions. Word has length 57 [2021-12-16 02:29:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:34,960 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 761 transitions. [2021-12-16 02:29:34,961 INFO L471 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) [2021-12-16 02:29:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 761 transitions. [2021-12-16 02:29:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:34,962 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:34,962 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:34,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:29:34,962 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash 905343052, now seen corresponding path program 1 times [2021-12-16 02:29:34,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443361413] [2021-12-16 02:29:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:34,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:35,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:35,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443361413] [2021-12-16 02:29:35,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443361413] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:35,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:35,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:35,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879685626] [2021-12-16 02:29:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:35,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:35,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:35,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:35,051 INFO L87 Difference]: Start difference. First operand 555 states and 761 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) [2021-12-16 02:29:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:35,320 INFO L93 Difference]: Finished difference Result 776 states and 1079 transitions. [2021-12-16 02:29:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:29:35,320 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 [2021-12-16 02:29:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:35,323 INFO L225 Difference]: With dead ends: 776 [2021-12-16 02:29:35,323 INFO L226 Difference]: Without dead ends: 593 [2021-12-16 02:29:35,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:29:35,324 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 421 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:35,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 545 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-12-16 02:29:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 555. [2021-12-16 02:29:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 475 states have (on average 1.3642105263157895) internal successors, (648), 483 states have internal predecessors, (648), 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) [2021-12-16 02:29:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 759 transitions. [2021-12-16 02:29:35,345 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 759 transitions. Word has length 57 [2021-12-16 02:29:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:35,345 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 759 transitions. [2021-12-16 02:29:35,345 INFO L471 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) [2021-12-16 02:29:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 759 transitions. [2021-12-16 02:29:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:35,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:35,347 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:35,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:29:35,347 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1153489546, now seen corresponding path program 1 times [2021-12-16 02:29:35,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:35,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640218088] [2021-12-16 02:29:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:35,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:35,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:35,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640218088] [2021-12-16 02:29:35,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640218088] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:35,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:35,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:35,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023088438] [2021-12-16 02:29:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:35,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:35,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:35,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:35,411 INFO L87 Difference]: Start difference. First operand 555 states and 759 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) [2021-12-16 02:29:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:35,772 INFO L93 Difference]: Finished difference Result 803 states and 1124 transitions. [2021-12-16 02:29:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 02:29:35,773 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 [2021-12-16 02:29:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:35,776 INFO L225 Difference]: With dead ends: 803 [2021-12-16 02:29:35,776 INFO L226 Difference]: Without dead ends: 621 [2021-12-16 02:29:35,777 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:35,777 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 222 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:35,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 936 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-12-16 02:29:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 561. [2021-12-16 02:29:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 481 states have (on average 1.3596673596673596) internal successors, (654), 489 states have internal predecessors, (654), 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) [2021-12-16 02:29:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 765 transitions. [2021-12-16 02:29:35,822 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 765 transitions. Word has length 57 [2021-12-16 02:29:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:35,823 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 765 transitions. [2021-12-16 02:29:35,823 INFO L471 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) [2021-12-16 02:29:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 765 transitions. [2021-12-16 02:29:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:35,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:35,825 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:35,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:29:35,825 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1081102988, now seen corresponding path program 1 times [2021-12-16 02:29:35,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:35,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248898323] [2021-12-16 02:29:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:35,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:35,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:35,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248898323] [2021-12-16 02:29:35,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248898323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:35,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:35,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:29:35,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601715467] [2021-12-16 02:29:35,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:35,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:29:35,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:35,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:29:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:29:35,936 INFO L87 Difference]: Start difference. First operand 561 states and 765 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) [2021-12-16 02:29:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:36,414 INFO L93 Difference]: Finished difference Result 992 states and 1366 transitions. [2021-12-16 02:29:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:29:36,414 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 [2021-12-16 02:29:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:36,417 INFO L225 Difference]: With dead ends: 992 [2021-12-16 02:29:36,418 INFO L226 Difference]: Without dead ends: 804 [2021-12-16 02:29:36,418 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:36,419 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 563 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:36,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 779 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 02:29:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-12-16 02:29:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 732. [2021-12-16 02:29:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 620 states have (on average 1.3629032258064515) internal successors, (845), 629 states have internal predecessors, (845), 68 states have call successors, (68), 39 states have call predecessors, (68), 42 states have return successors, (83), 64 states have call predecessors, (83), 66 states have call successors, (83) [2021-12-16 02:29:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 996 transitions. [2021-12-16 02:29:36,477 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 996 transitions. Word has length 57 [2021-12-16 02:29:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:36,477 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 996 transitions. [2021-12-16 02:29:36,478 INFO L471 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) [2021-12-16 02:29:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 996 transitions. [2021-12-16 02:29:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:36,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:36,478 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:36,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:29:36,479 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash -690367987, now seen corresponding path program 1 times [2021-12-16 02:29:36,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:36,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375341162] [2021-12-16 02:29:36,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:36,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:36,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:36,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375341162] [2021-12-16 02:29:36,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375341162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:36,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:36,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:36,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124053373] [2021-12-16 02:29:36,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:36,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:36,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:36,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:36,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:36,591 INFO L87 Difference]: Start difference. First operand 732 states and 996 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) [2021-12-16 02:29:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:36,932 INFO L93 Difference]: Finished difference Result 1181 states and 1630 transitions. [2021-12-16 02:29:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:29:36,932 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 [2021-12-16 02:29:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:36,937 INFO L225 Difference]: With dead ends: 1181 [2021-12-16 02:29:36,937 INFO L226 Difference]: Without dead ends: 822 [2021-12-16 02:29:36,938 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:36,938 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 187 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:36,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 938 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-12-16 02:29:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 738. [2021-12-16 02:29:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 626 states have (on average 1.3562300319488818) internal successors, (849), 635 states have internal predecessors, (849), 68 states have call successors, (68), 39 states have call predecessors, (68), 42 states have return successors, (83), 64 states have call predecessors, (83), 66 states have call successors, (83) [2021-12-16 02:29:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1000 transitions. [2021-12-16 02:29:36,971 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1000 transitions. Word has length 57 [2021-12-16 02:29:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:36,971 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1000 transitions. [2021-12-16 02:29:36,971 INFO L471 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) [2021-12-16 02:29:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1000 transitions. [2021-12-16 02:29:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:36,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:36,972 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:36,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:29:36,973 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1232860047, now seen corresponding path program 1 times [2021-12-16 02:29:36,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:36,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616737214] [2021-12-16 02:29:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:36,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:37,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:37,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616737214] [2021-12-16 02:29:37,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616737214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:37,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:37,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:37,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213795463] [2021-12-16 02:29:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:37,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:37,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:37,036 INFO L87 Difference]: Start difference. First operand 738 states and 1000 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 02:29:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:37,277 INFO L93 Difference]: Finished difference Result 1172 states and 1588 transitions. [2021-12-16 02:29:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:29:37,277 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-16 02:29:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:37,281 INFO L225 Difference]: With dead ends: 1172 [2021-12-16 02:29:37,282 INFO L226 Difference]: Without dead ends: 808 [2021-12-16 02:29:37,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:29:37,284 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 454 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:37,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 533 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2021-12-16 02:29:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 738. [2021-12-16 02:29:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 626 states have (on average 1.340255591054313) internal successors, (839), 635 states have internal predecessors, (839), 68 states have call successors, (68), 39 states have call predecessors, (68), 42 states have return successors, (83), 64 states have call predecessors, (83), 66 states have call successors, (83) [2021-12-16 02:29:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 990 transitions. [2021-12-16 02:29:37,312 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 990 transitions. Word has length 57 [2021-12-16 02:29:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:37,312 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 990 transitions. [2021-12-16 02:29:37,312 INFO L471 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 02:29:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 990 transitions. [2021-12-16 02:29:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:37,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:37,313 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:37,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 02:29:37,314 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1451714765, now seen corresponding path program 1 times [2021-12-16 02:29:37,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:37,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973011128] [2021-12-16 02:29:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:37,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:37,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:37,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973011128] [2021-12-16 02:29:37,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973011128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:37,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:37,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:37,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457499804] [2021-12-16 02:29:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:37,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:37,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:37,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:37,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:37,370 INFO L87 Difference]: Start difference. First operand 738 states and 990 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 02:29:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:37,750 INFO L93 Difference]: Finished difference Result 1347 states and 1823 transitions. [2021-12-16 02:29:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:29:37,750 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-16 02:29:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:37,754 INFO L225 Difference]: With dead ends: 1347 [2021-12-16 02:29:37,754 INFO L226 Difference]: Without dead ends: 982 [2021-12-16 02:29:37,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-16 02:29:37,756 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 430 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:37,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 717 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2021-12-16 02:29:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 862. [2021-12-16 02:29:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 724 states have (on average 1.3107734806629834) internal successors, (949), 737 states have internal predecessors, (949), 80 states have call successors, (80), 49 states have call predecessors, (80), 56 states have return successors, (121), 76 states have call predecessors, (121), 78 states have call successors, (121) [2021-12-16 02:29:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1150 transitions. [2021-12-16 02:29:37,790 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1150 transitions. Word has length 57 [2021-12-16 02:29:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:37,790 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1150 transitions. [2021-12-16 02:29:37,790 INFO L471 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 02:29:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1150 transitions. [2021-12-16 02:29:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:37,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:37,791 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:37,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 02:29:37,792 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1874416591, now seen corresponding path program 1 times [2021-12-16 02:29:37,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:37,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821518215] [2021-12-16 02:29:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:37,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:37,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:37,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821518215] [2021-12-16 02:29:37,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821518215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:37,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:37,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:37,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034762499] [2021-12-16 02:29:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:37,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:37,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:37,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:37,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:37,847 INFO L87 Difference]: Start difference. First operand 862 states and 1150 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 02:29:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:38,115 INFO L93 Difference]: Finished difference Result 1474 states and 1952 transitions. [2021-12-16 02:29:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 02:29:38,115 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-16 02:29:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:38,119 INFO L225 Difference]: With dead ends: 1474 [2021-12-16 02:29:38,119 INFO L226 Difference]: Without dead ends: 988 [2021-12-16 02:29:38,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 02:29:38,121 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 497 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:38,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 541 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2021-12-16 02:29:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 922. [2021-12-16 02:29:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 778 states have (on average 1.2737789203084833) internal successors, (991), 791 states have internal predecessors, (991), 80 states have call successors, (80), 53 states have call predecessors, (80), 62 states have return successors, (119), 78 states have call predecessors, (119), 78 states have call successors, (119) [2021-12-16 02:29:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1190 transitions. [2021-12-16 02:29:38,166 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1190 transitions. Word has length 57 [2021-12-16 02:29:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:38,166 INFO L470 AbstractCegarLoop]: Abstraction has 922 states and 1190 transitions. [2021-12-16 02:29:38,166 INFO L471 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 02:29:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1190 transitions. [2021-12-16 02:29:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 02:29:38,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:38,167 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:38,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 02:29:38,168 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2021-12-16 02:29:38,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:38,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838392816] [2021-12-16 02:29:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:38,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:38,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838392816] [2021-12-16 02:29:38,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838392816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:38,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:38,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:29:38,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974007348] [2021-12-16 02:29:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:38,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:29:38,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:29:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:38,204 INFO L87 Difference]: Start difference. First operand 922 states and 1190 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) [2021-12-16 02:29:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:38,466 INFO L93 Difference]: Finished difference Result 2052 states and 2602 transitions. [2021-12-16 02:29:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 02:29:38,467 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 [2021-12-16 02:29:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:38,472 INFO L225 Difference]: With dead ends: 2052 [2021-12-16 02:29:38,477 INFO L226 Difference]: Without dead ends: 1504 [2021-12-16 02:29:38,479 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:38,480 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 423 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:38,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 545 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2021-12-16 02:29:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1422. [2021-12-16 02:29:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1184 states have (on average 1.2373310810810811) internal successors, (1465), 1207 states have internal predecessors, (1465), 130 states have call successors, (130), 91 states have call predecessors, (130), 106 states have return successors, (184), 124 states have call predecessors, (184), 128 states have call successors, (184) [2021-12-16 02:29:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1779 transitions. [2021-12-16 02:29:38,549 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1779 transitions. Word has length 57 [2021-12-16 02:29:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:38,549 INFO L470 AbstractCegarLoop]: Abstraction has 1422 states and 1779 transitions. [2021-12-16 02:29:38,549 INFO L471 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) [2021-12-16 02:29:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1779 transitions. [2021-12-16 02:29:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-16 02:29:38,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:38,551 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:38,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 02:29:38,551 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2021-12-16 02:29:38,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:38,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261961718] [2021-12-16 02:29:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:38,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 02:29:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 02:29:38,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:38,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261961718] [2021-12-16 02:29:38,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261961718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:38,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:38,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:38,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861520553] [2021-12-16 02:29:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:38,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:38,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:38,579 INFO L87 Difference]: Start difference. First operand 1422 states and 1779 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) [2021-12-16 02:29:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:38,728 INFO L93 Difference]: Finished difference Result 2006 states and 2564 transitions. [2021-12-16 02:29:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:38,728 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 [2021-12-16 02:29:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:38,734 INFO L225 Difference]: With dead ends: 2006 [2021-12-16 02:29:38,734 INFO L226 Difference]: Without dead ends: 1650 [2021-12-16 02:29:38,735 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:38,736 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 128 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:38,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 607 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2021-12-16 02:29:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1612. [2021-12-16 02:29:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1350 states have (on average 1.2333333333333334) internal successors, (1665), 1375 states have internal predecessors, (1665), 144 states have call successors, (144), 99 states have call predecessors, (144), 116 states have return successors, (208), 138 states have call predecessors, (208), 142 states have call successors, (208) [2021-12-16 02:29:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2017 transitions. [2021-12-16 02:29:38,821 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2017 transitions. Word has length 62 [2021-12-16 02:29:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:38,821 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 2017 transitions. [2021-12-16 02:29:38,822 INFO L471 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) [2021-12-16 02:29:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2017 transitions. [2021-12-16 02:29:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 02:29:38,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:38,823 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:38,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 02:29:38,824 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2021-12-16 02:29:38,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:38,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997215934] [2021-12-16 02:29:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:38,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 02:29:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 02:29:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 02:29:38,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:38,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997215934] [2021-12-16 02:29:38,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997215934] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:38,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:38,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:38,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399575830] [2021-12-16 02:29:38,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:38,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:38,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:38,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:38,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:38,857 INFO L87 Difference]: Start difference. First operand 1612 states and 2017 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) [2021-12-16 02:29:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:38,978 INFO L93 Difference]: Finished difference Result 2265 states and 2870 transitions. [2021-12-16 02:29:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:38,979 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 [2021-12-16 02:29:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:38,985 INFO L225 Difference]: With dead ends: 2265 [2021-12-16 02:29:38,985 INFO L226 Difference]: Without dead ends: 1811 [2021-12-16 02:29:38,987 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:38,987 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 268 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:38,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 449 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2021-12-16 02:29:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1756. [2021-12-16 02:29:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1478 states have (on average 1.2286874154262517) internal successors, (1816), 1505 states have internal predecessors, (1816), 152 states have call successors, (152), 105 states have call predecessors, (152), 124 states have return successors, (222), 146 states have call predecessors, (222), 150 states have call successors, (222) [2021-12-16 02:29:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2190 transitions. [2021-12-16 02:29:39,077 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2190 transitions. Word has length 67 [2021-12-16 02:29:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:39,078 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 2190 transitions. [2021-12-16 02:29:39,078 INFO L471 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) [2021-12-16 02:29:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2190 transitions. [2021-12-16 02:29:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-16 02:29:39,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:39,081 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:39,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 02:29:39,081 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2021-12-16 02:29:39,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:39,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976163345] [2021-12-16 02:29:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:39,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 02:29:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 02:29:39,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:39,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976163345] [2021-12-16 02:29:39,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976163345] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:39,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453081273] [2021-12-16 02:29:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:39,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:39,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:39,162 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) [2021-12-16 02:29:39,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 02:29:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 02:29:39,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:39,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 02:29:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 02:29:39,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453081273] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:39,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 02:29:39,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2021-12-16 02:29:39,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276222117] [2021-12-16 02:29:39,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:39,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:39,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:39,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:39,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:39,463 INFO L87 Difference]: Start difference. First operand 1756 states and 2190 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) [2021-12-16 02:29:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:39,632 INFO L93 Difference]: Finished difference Result 1812 states and 2258 transitions. [2021-12-16 02:29:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 02:29:39,633 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 [2021-12-16 02:29:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:39,639 INFO L225 Difference]: With dead ends: 1812 [2021-12-16 02:29:39,639 INFO L226 Difference]: Without dead ends: 1809 [2021-12-16 02:29:39,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 02:29:39,640 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 385 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 321 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.0s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:39,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 321 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2021-12-16 02:29:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1755. [2021-12-16 02:29:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1478 states have (on average 1.2273342354533152) internal successors, (1814), 1504 states have internal predecessors, (1814), 151 states have call successors, (151), 105 states have call predecessors, (151), 124 states have return successors, (222), 146 states have call predecessors, (222), 150 states have call successors, (222) [2021-12-16 02:29:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2187 transitions. [2021-12-16 02:29:39,721 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2187 transitions. Word has length 68 [2021-12-16 02:29:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:39,721 INFO L470 AbstractCegarLoop]: Abstraction has 1755 states and 2187 transitions. [2021-12-16 02:29:39,721 INFO L471 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) [2021-12-16 02:29:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2187 transitions. [2021-12-16 02:29:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:39,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:39,723 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:39,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 02:29:39,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-16 02:29:39,940 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:39,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1574463180, now seen corresponding path program 1 times [2021-12-16 02:29:39,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:39,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135080840] [2021-12-16 02:29:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:39,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 02:29:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 02:29:39,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:39,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135080840] [2021-12-16 02:29:39,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135080840] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:39,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204921677] [2021-12-16 02:29:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:39,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:39,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:39,994 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) [2021-12-16 02:29:40,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 02:29:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:40,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 02:29:40,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:40,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 02:29:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 02:29:40,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204921677] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 02:29:40,414 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 02:29:40,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2021-12-16 02:29:40,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286398540] [2021-12-16 02:29:40,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 02:29:40,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:29:40,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:40,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:29:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:29:40,416 INFO L87 Difference]: Start difference. First operand 1755 states and 2187 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) [2021-12-16 02:29:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:41,192 INFO L93 Difference]: Finished difference Result 3455 states and 4407 transitions. [2021-12-16 02:29:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-16 02:29:41,193 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 [2021-12-16 02:29:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:41,203 INFO L225 Difference]: With dead ends: 3455 [2021-12-16 02:29:41,203 INFO L226 Difference]: Without dead ends: 2911 [2021-12-16 02:29:41,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2021-12-16 02:29:41,206 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 593 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:41,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 2377 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2021-12-16 02:29:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2144. [2021-12-16 02:29:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1828 states have (on average 1.2297592997811817) internal successors, (2248), 1862 states have internal predecessors, (2248), 171 states have call successors, (171), 119 states have call predecessors, (171), 143 states have return successors, (256), 163 states have call predecessors, (256), 170 states have call successors, (256) [2021-12-16 02:29:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2675 transitions. [2021-12-16 02:29:41,317 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2675 transitions. Word has length 69 [2021-12-16 02:29:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:41,317 INFO L470 AbstractCegarLoop]: Abstraction has 2144 states and 2675 transitions. [2021-12-16 02:29:41,317 INFO L471 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) [2021-12-16 02:29:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2675 transitions. [2021-12-16 02:29:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-16 02:29:41,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:41,320 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:41,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 02:29:41,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-16 02:29:41,537 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1815627380, now seen corresponding path program 1 times [2021-12-16 02:29:41,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:41,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227509007] [2021-12-16 02:29:41,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:41,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 02:29:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 02:29:41,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:41,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227509007] [2021-12-16 02:29:41,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227509007] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:41,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178703337] [2021-12-16 02:29:41,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:41,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:41,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:41,601 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) [2021-12-16 02:29:41,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 02:29:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:29:41,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 02:29:41,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:41,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178703337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:41,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:41,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 02:29:41,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870541787] [2021-12-16 02:29:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:41,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:41,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:41,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:41,761 INFO L87 Difference]: Start difference. First operand 2144 states and 2675 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) [2021-12-16 02:29:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:41,844 INFO L93 Difference]: Finished difference Result 2867 states and 3613 transitions. [2021-12-16 02:29:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:41,845 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 [2021-12-16 02:29:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:41,852 INFO L225 Difference]: With dead ends: 2867 [2021-12-16 02:29:41,852 INFO L226 Difference]: Without dead ends: 2022 [2021-12-16 02:29:41,854 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:41,855 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 189 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 335 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 [2021-12-16 02:29:41,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 335 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2021-12-16 02:29:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2007. [2021-12-16 02:29:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1707 states have (on average 1.2243702401874634) internal successors, (2090), 1740 states have internal predecessors, (2090), 163 states have call successors, (163), 113 states have call predecessors, (163), 135 states have return successors, (242), 154 states have call predecessors, (242), 162 states have call successors, (242) [2021-12-16 02:29:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2495 transitions. [2021-12-16 02:29:41,942 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2495 transitions. Word has length 88 [2021-12-16 02:29:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:41,942 INFO L470 AbstractCegarLoop]: Abstraction has 2007 states and 2495 transitions. [2021-12-16 02:29:41,943 INFO L471 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) [2021-12-16 02:29:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2495 transitions. [2021-12-16 02:29:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-16 02:29:41,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:41,947 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:41,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 02:29:42,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:42,184 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2021-12-16 02:29:42,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:42,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883242425] [2021-12-16 02:29:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:42,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 02:29:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 02:29:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 02:29:42,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:42,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883242425] [2021-12-16 02:29:42,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883242425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:42,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:42,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:42,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116208679] [2021-12-16 02:29:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:42,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:42,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:42,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:42,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:42,266 INFO L87 Difference]: Start difference. First operand 2007 states and 2495 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) [2021-12-16 02:29:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:42,790 INFO L93 Difference]: Finished difference Result 4173 states and 5144 transitions. [2021-12-16 02:29:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:29:42,791 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 [2021-12-16 02:29:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:42,803 INFO L225 Difference]: With dead ends: 4173 [2021-12-16 02:29:42,803 INFO L226 Difference]: Without dead ends: 3127 [2021-12-16 02:29:42,806 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:42,808 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 447 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:42,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 665 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2021-12-16 02:29:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3009. [2021-12-16 02:29:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2520 states have (on average 1.2059523809523809) internal successors, (3039), 2574 states have internal predecessors, (3039), 260 states have call successors, (260), 185 states have call predecessors, (260), 227 states have return successors, (409), 251 states have call predecessors, (409), 259 states have call successors, (409) [2021-12-16 02:29:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 3708 transitions. [2021-12-16 02:29:42,976 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 3708 transitions. Word has length 92 [2021-12-16 02:29:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:42,977 INFO L470 AbstractCegarLoop]: Abstraction has 3009 states and 3708 transitions. [2021-12-16 02:29:42,977 INFO L471 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) [2021-12-16 02:29:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 3708 transitions. [2021-12-16 02:29:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-16 02:29:42,980 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:42,980 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:42,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 02:29:42,980 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2021-12-16 02:29:42,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:42,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831443571] [2021-12-16 02:29:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:42,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 02:29:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 02:29:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-16 02:29:43,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:43,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831443571] [2021-12-16 02:29:43,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831443571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:43,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:43,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:29:43,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559762061] [2021-12-16 02:29:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:43,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:29:43,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:43,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:29:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:43,034 INFO L87 Difference]: Start difference. First operand 3009 states and 3708 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) [2021-12-16 02:29:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:43,308 INFO L93 Difference]: Finished difference Result 4675 states and 5711 transitions. [2021-12-16 02:29:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:29:43,309 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 [2021-12-16 02:29:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:43,317 INFO L225 Difference]: With dead ends: 4675 [2021-12-16 02:29:43,318 INFO L226 Difference]: Without dead ends: 2627 [2021-12-16 02:29:43,322 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:43,322 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 286 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:43,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 473 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2021-12-16 02:29:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2525. [2021-12-16 02:29:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2129 states have (on average 1.2123062470643495) internal successors, (2581), 2174 states have internal predecessors, (2581), 209 states have call successors, (209), 149 states have call predecessors, (209), 185 states have return successors, (328), 202 states have call predecessors, (328), 208 states have call successors, (328) [2021-12-16 02:29:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 3118 transitions. [2021-12-16 02:29:43,438 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 3118 transitions. Word has length 92 [2021-12-16 02:29:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:43,438 INFO L470 AbstractCegarLoop]: Abstraction has 2525 states and 3118 transitions. [2021-12-16 02:29:43,438 INFO L471 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) [2021-12-16 02:29:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 3118 transitions. [2021-12-16 02:29:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-16 02:29:43,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:43,441 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:43,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 02:29:43,442 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 172011463, now seen corresponding path program 1 times [2021-12-16 02:29:43,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:43,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522684063] [2021-12-16 02:29:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:43,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 02:29:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 02:29:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-16 02:29:43,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:43,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522684063] [2021-12-16 02:29:43,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522684063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:43,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:43,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:43,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873134050] [2021-12-16 02:29:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:43,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:43,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:43,500 INFO L87 Difference]: Start difference. First operand 2525 states and 3118 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) [2021-12-16 02:29:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:44,591 INFO L93 Difference]: Finished difference Result 4847 states and 5969 transitions. [2021-12-16 02:29:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 02:29:44,593 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 [2021-12-16 02:29:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:44,613 INFO L225 Difference]: With dead ends: 4847 [2021-12-16 02:29:44,613 INFO L226 Difference]: Without dead ends: 3283 [2021-12-16 02:29:44,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-12-16 02:29:44,620 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 1094 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:44,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1109 Valid, 805 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-16 02:29:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2021-12-16 02:29:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3192. [2021-12-16 02:29:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 2674 states have (on average 1.193343305908751) internal successors, (3191), 2734 states have internal predecessors, (3191), 270 states have call successors, (270), 193 states have call predecessors, (270), 246 states have return successors, (418), 265 states have call predecessors, (418), 269 states have call successors, (418) [2021-12-16 02:29:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 3879 transitions. [2021-12-16 02:29:44,791 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 3879 transitions. Word has length 93 [2021-12-16 02:29:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:44,791 INFO L470 AbstractCegarLoop]: Abstraction has 3192 states and 3879 transitions. [2021-12-16 02:29:44,791 INFO L471 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) [2021-12-16 02:29:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 3879 transitions. [2021-12-16 02:29:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-16 02:29:44,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:44,794 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:44,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 02:29:44,794 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1890951514, now seen corresponding path program 1 times [2021-12-16 02:29:44,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:44,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919653178] [2021-12-16 02:29:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:44,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-16 02:29:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-16 02:29:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-16 02:29:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-16 02:29:44,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:44,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919653178] [2021-12-16 02:29:44,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919653178] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:44,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355949349] [2021-12-16 02:29:44,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:44,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:44,860 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) [2021-12-16 02:29:44,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 02:29:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:44,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-16 02:29:45,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:45,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355949349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:45,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:45,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 02:29:45,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555838089] [2021-12-16 02:29:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:45,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:45,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:45,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:45,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:45,114 INFO L87 Difference]: Start difference. First operand 3192 states and 3879 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) [2021-12-16 02:29:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:45,256 INFO L93 Difference]: Finished difference Result 3571 states and 4347 transitions. [2021-12-16 02:29:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:45,257 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 [2021-12-16 02:29:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:45,262 INFO L225 Difference]: With dead ends: 3571 [2021-12-16 02:29:45,262 INFO L226 Difference]: Without dead ends: 2245 [2021-12-16 02:29:45,264 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:45,265 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 62 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 476 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 [2021-12-16 02:29:45,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 476 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2021-12-16 02:29:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2021-12-16 02:29:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1830 states have (on average 1.1655737704918032) internal successors, (2133), 1874 states have internal predecessors, (2133), 213 states have call successors, (213), 156 states have call predecessors, (213), 201 states have return successors, (326), 215 states have call predecessors, (326), 213 states have call successors, (326) [2021-12-16 02:29:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 2672 transitions. [2021-12-16 02:29:45,365 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 2672 transitions. Word has length 103 [2021-12-16 02:29:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:45,366 INFO L470 AbstractCegarLoop]: Abstraction has 2245 states and 2672 transitions. [2021-12-16 02:29:45,366 INFO L471 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) [2021-12-16 02:29:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2672 transitions. [2021-12-16 02:29:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-16 02:29:45,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:45,368 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:45,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-16 02:29:45,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:45,584 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash -242597663, now seen corresponding path program 1 times [2021-12-16 02:29:45,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:45,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520950890] [2021-12-16 02:29:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:45,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 02:29:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:29:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-16 02:29:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 02:29:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-16 02:29:45,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520950890] [2021-12-16 02:29:45,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520950890] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:45,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864139155] [2021-12-16 02:29:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:45,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:45,647 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) [2021-12-16 02:29:45,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 02:29:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:29:45,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 02:29:45,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:45,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864139155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:45,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:45,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 02:29:45,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425777067] [2021-12-16 02:29:45,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:45,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:45,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:45,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:45,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:29:45,914 INFO L87 Difference]: Start difference. First operand 2245 states and 2672 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) [2021-12-16 02:29:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:46,054 INFO L93 Difference]: Finished difference Result 3771 states and 4580 transitions. [2021-12-16 02:29:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:46,055 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 [2021-12-16 02:29:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:46,061 INFO L225 Difference]: With dead ends: 3771 [2021-12-16 02:29:46,061 INFO L226 Difference]: Without dead ends: 2243 [2021-12-16 02:29:46,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:29:46,066 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 72 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 341 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 [2021-12-16 02:29:46,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 341 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2021-12-16 02:29:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2229. [2021-12-16 02:29:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 1814 states have (on average 1.1438809261300993) internal successors, (2075), 1858 states have internal predecessors, (2075), 213 states have call successors, (213), 156 states have call predecessors, (213), 201 states have return successors, (326), 215 states have call predecessors, (326), 213 states have call successors, (326) [2021-12-16 02:29:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2614 transitions. [2021-12-16 02:29:46,189 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2614 transitions. Word has length 135 [2021-12-16 02:29:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:46,190 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 2614 transitions. [2021-12-16 02:29:46,190 INFO L471 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) [2021-12-16 02:29:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2614 transitions. [2021-12-16 02:29:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-16 02:29:46,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:46,195 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:46,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 02:29:46,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-16 02:29:46,414 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:46,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash 652625369, now seen corresponding path program 1 times [2021-12-16 02:29:46,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:46,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536306503] [2021-12-16 02:29:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:46,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 02:29:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:29:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-16 02:29:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 02:29:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-16 02:29:46,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:46,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536306503] [2021-12-16 02:29:46,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536306503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:46,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:46,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:29:46,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341244542] [2021-12-16 02:29:46,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:46,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:29:46,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:46,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:29:46,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:29:46,484 INFO L87 Difference]: Start difference. First operand 2229 states and 2614 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) [2021-12-16 02:29:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:47,044 INFO L93 Difference]: Finished difference Result 6710 states and 7866 transitions. [2021-12-16 02:29:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:29:47,045 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 [2021-12-16 02:29:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:47,068 INFO L225 Difference]: With dead ends: 6710 [2021-12-16 02:29:47,068 INFO L226 Difference]: Without dead ends: 5094 [2021-12-16 02:29:47,073 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:47,074 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 506 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:47,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 510 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2021-12-16 02:29:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 4171. [2021-12-16 02:29:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 3412 states have (on average 1.1483001172332943) internal successors, (3918), 3491 states have internal predecessors, (3918), 392 states have call successors, (392), 286 states have call predecessors, (392), 366 states have return successors, (608), 394 states have call predecessors, (608), 392 states have call successors, (608) [2021-12-16 02:29:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 4918 transitions. [2021-12-16 02:29:47,332 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 4918 transitions. Word has length 136 [2021-12-16 02:29:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:47,332 INFO L470 AbstractCegarLoop]: Abstraction has 4171 states and 4918 transitions. [2021-12-16 02:29:47,332 INFO L471 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) [2021-12-16 02:29:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 4918 transitions. [2021-12-16 02:29:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-16 02:29:47,337 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:47,337 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:47,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 02:29:47,337 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1954098622, now seen corresponding path program 1 times [2021-12-16 02:29:47,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:47,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847605254] [2021-12-16 02:29:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:47,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 02:29:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 02:29:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-16 02:29:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-16 02:29:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-16 02:29:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-16 02:29:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 02:29:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-16 02:29:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-16 02:29:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-16 02:29:47,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:47,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847605254] [2021-12-16 02:29:47,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847605254] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:47,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151392211] [2021-12-16 02:29:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:47,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:47,434 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) [2021-12-16 02:29:47,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 02:29:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:47,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 02:29:47,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 02:29:47,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:47,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151392211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:47,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:47,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2021-12-16 02:29:47,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112864618] [2021-12-16 02:29:47,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:47,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:29:47,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:47,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:29:47,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:29:47,772 INFO L87 Difference]: Start difference. First operand 4171 states and 4918 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) [2021-12-16 02:29:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:47,885 INFO L93 Difference]: Finished difference Result 6164 states and 7288 transitions. [2021-12-16 02:29:47,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:29:47,886 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 [2021-12-16 02:29:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:47,892 INFO L225 Difference]: With dead ends: 6164 [2021-12-16 02:29:47,892 INFO L226 Difference]: Without dead ends: 2007 [2021-12-16 02:29:47,900 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:47,901 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 32 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:47,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 658 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2021-12-16 02:29:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1842. [2021-12-16 02:29:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1542 states have (on average 1.1491569390402074) internal successors, (1772), 1560 states have internal predecessors, (1772), 151 states have call successors, (151), 114 states have call predecessors, (151), 148 states have return successors, (238), 167 states have call predecessors, (238), 151 states have call successors, (238) [2021-12-16 02:29:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2161 transitions. [2021-12-16 02:29:48,000 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2161 transitions. Word has length 159 [2021-12-16 02:29:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:48,001 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 2161 transitions. [2021-12-16 02:29:48,001 INFO L471 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) [2021-12-16 02:29:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2161 transitions. [2021-12-16 02:29:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-16 02:29:48,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:48,004 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:29:48,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-16 02:29:48,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-16 02:29:48,220 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1415226387, now seen corresponding path program 1 times [2021-12-16 02:29:48,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:48,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906524846] [2021-12-16 02:29:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:48,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 02:29:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-16 02:29:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-16 02:29:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 02:29:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-16 02:29:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-16 02:29:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-16 02:29:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-16 02:29:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-16 02:29:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-16 02:29:48,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906524846] [2021-12-16 02:29:48,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906524846] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189704709] [2021-12-16 02:29:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:48,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:48,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:48,304 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) [2021-12-16 02:29:48,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 02:29:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 02:29:48,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-16 02:29:48,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 02:29:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-12-16 02:29:49,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189704709] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 02:29:49,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 02:29:49,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2021-12-16 02:29:49,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181050697] [2021-12-16 02:29:49,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 02:29:49,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 02:29:49,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:49,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 02:29:49,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-16 02:29:49,009 INFO L87 Difference]: Start difference. First operand 1842 states and 2161 transitions. Second operand has 12 states, 12 states have (on average 18.5) internal successors, (222), 10 states have internal predecessors, (222), 6 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-16 02:29:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:49,289 INFO L93 Difference]: Finished difference Result 3258 states and 3788 transitions. [2021-12-16 02:29:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 02:29:49,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 18.5) internal successors, (222), 10 states have internal predecessors, (222), 6 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) Word has length 164 [2021-12-16 02:29:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:49,293 INFO L225 Difference]: With dead ends: 3258 [2021-12-16 02:29:49,293 INFO L226 Difference]: Without dead ends: 1453 [2021-12-16 02:29:49,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-12-16 02:29:49,297 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 520 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:49,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 382 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:29:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-12-16 02:29:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1356. [2021-12-16 02:29:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1141 states have (on average 1.133216476774759) internal successors, (1293), 1148 states have internal predecessors, (1293), 108 states have call successors, (108), 87 states have call predecessors, (108), 106 states have return successors, (152), 120 states have call predecessors, (152), 108 states have call successors, (152) [2021-12-16 02:29:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1553 transitions. [2021-12-16 02:29:49,374 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1553 transitions. Word has length 164 [2021-12-16 02:29:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:49,375 INFO L470 AbstractCegarLoop]: Abstraction has 1356 states and 1553 transitions. [2021-12-16 02:29:49,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.5) internal successors, (222), 10 states have internal predecessors, (222), 6 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-16 02:29:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1553 transitions. [2021-12-16 02:29:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-16 02:29:49,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:49,377 INFO L514 BasicCegarLoop]: 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] [2021-12-16 02:29:49,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 02:29:49,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:49,596 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 239124213, now seen corresponding path program 1 times [2021-12-16 02:29:49,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:49,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839492559] [2021-12-16 02:29:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:49,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 02:29:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 02:29:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 02:29:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 02:29:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:29:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-16 02:29:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 02:29:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-16 02:29:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-16 02:29:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-16 02:29:49,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839492559] [2021-12-16 02:29:49,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839492559] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723583547] [2021-12-16 02:29:49,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:49,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:49,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:49,692 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) [2021-12-16 02:29:49,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 02:29:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:49,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-16 02:29:50,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:50,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723583547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:50,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:50,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 02:29:50,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960494445] [2021-12-16 02:29:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:50,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:50,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:50,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:50,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:50,005 INFO L87 Difference]: Start difference. First operand 1356 states and 1553 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) [2021-12-16 02:29:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:50,044 INFO L93 Difference]: Finished difference Result 1789 states and 2054 transitions. [2021-12-16 02:29:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:50,045 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 [2021-12-16 02:29:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:50,045 INFO L225 Difference]: With dead ends: 1789 [2021-12-16 02:29:50,045 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 02:29:50,048 INFO L932 BasicCegarLoop]: 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 [2021-12-16 02:29:50,048 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 93 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 265 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 [2021-12-16 02:29:50,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 265 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 02:29:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 02:29:50,049 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) [2021-12-16 02:29:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 02:29:50,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2021-12-16 02:29:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:50,049 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 02:29:50,049 INFO L471 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) [2021-12-16 02:29:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 02:29:50,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 02:29:50,052 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-16 02:29:50,052 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-16 02:29:50,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-16 02:29:50,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-16 02:29:50,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 02:30:02,765 WARN L227 SmtUtils]: Spent 11.03s on a formula simplification. DAG size of input: 131 DAG size of output: 129 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-16 02:30:14,089 WARN L227 SmtUtils]: Spent 10.21s on a formula simplification. DAG size of input: 134 DAG size of output: 132 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-16 02:30:28,702 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2021-12-16 02:30:28,702 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 706 716) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (= ~E_1~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~m_i~0 1))) (.cse3 (not (= ~token~0 ~local~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse18 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse6)) (.cse5 (not (= ~t1_i~0 1))) (.cse19 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (= ~T1_E~0 0)) (.cse11 (= 0 |old(~m_st~0)|)) (.cse12 (not (= ~p_dw_st~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (= 2 ~M_E~0))) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= ~p_dw_pc~0 0))) (.cse17 (not (= ~c_dr_pc~0 0)))) (and (or .cse0 .cse1 (not (= |old(~t1_st~0)| 0)) .cse2 (not (<= ~t1_pc~0 0)) .cse3 .cse4 .cse5 (and .cse6 (= ~t1_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~m_pc~0 0)) .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 (not (<= ~token~0 (+ ~local~0 1))) .cse4 .cse18 .cse5 .cse19 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (< ~local~0 ~token~0)) .cse16 (not (< 0 ~E_M~0)) .cse17 (= ~E_1~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (<= 2 |old(~t1_st~0)|)))))) [2021-12-16 02:30:28,702 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L854 garLoopResultBuilder]: At program point L62(lines 46 64) the Hoare annotation is: (let ((.cse5 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse8 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse6 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse7 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse9 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse10 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse17 (not (= ~p_dw_pc~0 0))) (.cse0 (= ~E_1~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (= ~T1_E~0 0)) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (= ~m_pc~0 0))) (.cse19 (and .cse5 .cse8)) (.cse21 (not (= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse15 (not (= 2 ~M_E~0))) (.cse16 (= ~T1_E~0 1)) (.cse18 (= ~E_1~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~p_num_write~0 1)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (not (= ~c_num_read~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= ~c_dr_pc~0 0)) .cse18) (or .cse1 .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~q_free~0 1)) .cse2 .cse3 .cse4 (not (= ~c_last_read~0 ~p_last_write~0)) .cse12 .cse11 .cse14 .cse19 .cse16 .cse15 (not (<= 2 |old(~p_dw_st~0)|)) .cse18) (or .cse1 .cse0 .cse20 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 (and .cse6 .cse7 .cse9 .cse10) .cse21 .cse16 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse19 .cse21 .cse15 .cse16 .cse18)))) [2021-12-16 02:30:28,703 INFO L854 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~t1_st~0 0))) (.cse5 (= ~T1_E~0 0)) (.cse12 (not (= ~q_free~0 0))) (.cse7 (not (= ~m_pc~0 0))) (.cse8 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse10 (not (= 2 ~M_E~0))) (.cse9 (= ~T1_E~0 1)) (.cse11 (= ~E_1~0 1))) (and (or .cse0 .cse1 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~q_free~0 1)) .cse2 .cse3 .cse4 (not (= ~c_last_read~0 ~p_last_write~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= 2 |old(~p_dw_st~0)|)) .cse11) (or .cse1 .cse0 (not (= 2 |old(~c_dr_st~0)|)) .cse2 .cse3 .cse4 .cse6 .cse5 .cse12 .cse7 .cse8 (not (= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse10 .cse9 .cse11) (or .cse1 .cse0 .cse2 .cse3 .cse4 (not (= ~p_num_write~0 1)) (not (= ~c_num_read~0 0)) .cse6 .cse5 .cse12 .cse7 .cse8 .cse10 .cse9 (not (= ~p_dw_pc~0 0)) (not (= ~c_dr_pc~0 0)) .cse11))) [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L854 garLoopResultBuilder]: At program point L81(lines 65 83) the Hoare annotation is: (let ((.cse2 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse14 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse16 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse17 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse18 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse8 (not (= ~q_free~0 0))) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (= ~E_1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 1)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse22 (= ~p_dw_st~0 0)) (.cse13 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse15 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse7 (= ~T1_E~0 0)) (.cse6 (not (= ~t1_st~0 0))) (.cse9 (not (= ~m_pc~0 0))) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= 2 ~M_E~0))) (.cse21 (= ~E_1~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21) (or .cse1 .cse0 .cse2 .cse3 (and (or .cse13 .cse22) (= 2 ~c_dr_st~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse21) (or .cse1 .cse0 .cse3 .cse4 (and .cse13 .cse14 .cse15 .cse16 .cse23 .cse17 .cse18 .cse19) .cse5 (not (= ~p_num_write~0 1)) (not (= ~c_num_read~0 0)) .cse6 .cse7 .cse8 .cse9 .cse12 .cse11 .cse20 (not (= ~c_dr_pc~0 0)) .cse21) (or .cse0 .cse1 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~q_free~0 1)) .cse3 .cse4 .cse5 .cse22 (and .cse13 .cse15 .cse23 .cse19) (not (= ~c_last_read~0 ~p_last_write~0)) .cse7 .cse6 .cse9 .cse11 .cse12 (not (<= 2 |old(~p_dw_st~0)|)) .cse21))) [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2021-12-16 02:30:28,703 INFO L854 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse18 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (and .cse18 .cse19)) (.cse16 (not (= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse1 (= ~E_1~0 0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse13 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse14 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse6 (not (= ~t1_st~0 0))) (.cse5 (= ~T1_E~0 0)) (.cse15 (not (= ~q_free~0 0))) (.cse7 (not (= ~m_pc~0 0))) (.cse10 (not (= 2 ~M_E~0))) (.cse9 (= ~T1_E~0 1)) (.cse17 (not (= ~p_dw_pc~0 0))) (.cse11 (= ~E_1~0 1))) (and (or .cse0 .cse1 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~q_free~0 1)) .cse2 .cse3 .cse4 (not (= ~c_last_read~0 ~p_last_write~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= 2 |old(~p_dw_st~0)|)) .cse11) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 (and .cse13 .cse14) .cse6 .cse5 .cse15 .cse7 .cse16 .cse9 .cse10 .cse17 .cse11) (or .cse1 .cse0 .cse12 .cse2 .cse3 .cse4 .cse6 .cse5 .cse15 .cse7 .cse8 .cse16 .cse10 .cse9 .cse11) (or .cse1 .cse0 .cse2 .cse3 .cse4 (and .cse18 .cse13 .cse19 .cse14) (not (= ~p_num_write~0 1)) (not (= ~c_num_read~0 0)) .cse6 .cse5 .cse15 .cse7 .cse10 .cse9 .cse17 (not (= ~c_dr_pc~0 0)) .cse11)))) [2021-12-16 02:30:28,703 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L854 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse2 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse14 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse16 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse17 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse18 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse8 (not (= ~q_free~0 0))) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (= ~E_1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 1)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse22 (= ~p_dw_st~0 0)) (.cse13 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse15 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse7 (= ~T1_E~0 0)) (.cse6 (not (= ~t1_st~0 0))) (.cse9 (not (= ~m_pc~0 0))) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= 2 ~M_E~0))) (.cse21 (= ~E_1~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21) (or .cse1 .cse0 .cse2 .cse3 (and (or .cse13 .cse22) (= 2 ~c_dr_st~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse21) (or .cse1 .cse0 .cse3 .cse4 (and .cse13 .cse14 .cse15 .cse16 .cse23 .cse17 .cse18 .cse19) .cse5 (not (= ~p_num_write~0 1)) (not (= ~c_num_read~0 0)) .cse6 .cse7 .cse8 .cse9 .cse12 .cse11 .cse20 (not (= ~c_dr_pc~0 0)) .cse21) (or .cse0 .cse1 (not (= ~p_num_write~0 ~c_num_read~0)) (not (= ~q_free~0 1)) .cse3 .cse4 .cse5 .cse22 (and .cse13 .cse15 .cse23 .cse19) (not (= ~c_last_read~0 ~p_last_write~0)) .cse7 .cse6 .cse9 .cse11 .cse12 (not (<= 2 |old(~p_dw_st~0)|)) .cse21))) [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 625 652) the Hoare annotation is: (let ((.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~T1_E~0 |old(~T1_E~0)|))) (let ((.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (= |old(~E_1~0)| 0)) (.cse2 (not (= ~m_i~0 1))) (.cse6 (= |old(~T1_E~0)| 1)) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~T1_E~0)| 0)) (.cse10 (not (= ~t1_i~0 1))) (.cse19 (not (= ~t1_pc~0 1))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (= |old(~E_1~0)| 1)) (.cse20 (and (= ~M_E~0 |old(~M_E~0)|) .cse3 .cse4 .cse5)) (.cse21 (= 0 ~m_st~0)) (.cse16 (not (<= 2 |old(~E_M~0)|))) (.cse22 (not (<= 2 ~t1_st~0))) (.cse17 (not (= ~p_dw_pc~0 0))) (.cse18 (not (= ~c_dr_pc~0 0)))) (and (or .cse0 (not (= ~m_st~0 0)) .cse1 .cse2 (not (= 2 |old(~M_E~0)|)) (and .cse3 .cse4 (= 2 ~M_E~0) .cse5) .cse6 (not (<= ~t1_pc~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~t1_st~0 0)) .cse13 .cse14 .cse15 (not (= ~m_pc~0 0)) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse22 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse6 (not (<= ~token~0 (+ ~local~0 1))) .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse22 (not (< ~local~0 ~token~0)) .cse17 .cse18)))) [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2021-12-16 02:30:28,704 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 681 705) the Hoare annotation is: (let ((.cse27 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (not (<= ~t1_pc~0 0))) (.cse24 (and .cse27 (= ~t1_st~0 0))) (.cse25 (not (= ~m_pc~0 0))) (.cse3 (not (<= ~token~0 (+ ~local~0 1)))) (.cse16 (not (< ~local~0 ~token~0))) (.cse19 (= ~E_1~0 1)) (.cse0 (= ~E_1~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~m_i~0 1))) (.cse23 (not (= ~token~0 ~local~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse27)) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (= ~T1_E~0 0)) (.cse12 (= 0 |old(~m_st~0)|)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse26 (not (= 2 ~M_E~0))) (.cse15 (= ~T1_E~0 1)) (.cse17 (not (= ~p_dw_pc~0 0))) (.cse18 (not (= ~c_dr_pc~0 0))) (.cse20 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse23 .cse4 .cse6 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse26 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse23 .cse4 .cse6 .cse24 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse25 .cse26 .cse15 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 (not (< 0 ~E_M~0)) .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse5 .cse23 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse17 .cse18 .cse20)))) [2021-12-16 02:30:28,704 INFO L854 garLoopResultBuilder]: At program point L506(lines 490 508) the Hoare annotation is: (let ((.cse5 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse29 (<= 0 |activate_threads2_is_master_triggered_#res#1|)) (.cse30 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse31 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse32 (<= |activate_threads2_is_master_triggered_#res#1| 0))) (let ((.cse3 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (not (< ~local~0 ~token~0))) (.cse22 (and .cse29 .cse30 .cse31 .cse6 .cse32 (= ~t1_st~0 0))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (not (<= ~t1_pc~0 0))) (.cse27 (not (= ~m_pc~0 0))) (.cse21 (= ~E_1~0 1)) (.cse0 (= ~E_1~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~m_i~0 1))) (.cse25 (not (= ~token~0 ~local~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~t1_pc~0 1))) (.cse9 (not (= ~c_num_read~0 0))) (.cse26 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (= ~T1_E~0 0)) (.cse12 (= 0 |old(~m_st~0)|)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (= 2 ~M_E~0))) (.cse16 (= ~T1_E~0 1)) (.cse18 (and .cse29 .cse30 .cse31 .cse5 .cse6 .cse32)) (.cse19 (not (= ~p_dw_pc~0 0))) (.cse20 (not (= ~c_dr_pc~0 0))) (.cse28 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (= ~E_M~0 1) .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (< 0 ~E_M~0)) .cse20 .cse21) (or .cse0 .cse22 .cse1 .cse23 .cse2 .cse24 .cse25 .cse4 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse25 .cse4 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16 .cse19 .cse20 .cse21 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16 .cse17 .cse19 .cse20 .cse21 .cse28) (or .cse0 .cse22 .cse1 .cse23 .cse2 .cse24 .cse25 .cse4 .cse7 .cse9 .cse26 .cse10 .cse11 .cse13 .cse14 .cse27 .cse15 .cse16 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse25 .cse4 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse28)))) [2021-12-16 02:30:28,704 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L854 garLoopResultBuilder]: At program point L525(lines 509 527) the Hoare annotation is: (let ((.cse18 (= ~T1_E~0 1)) (.cse12 (= ~T1_E~0 0)) (.cse0 (= ~E_1~0 0))) (let ((.cse37 (= ~p_dw_pc~0 0)) (.cse29 (= ~q_free~0 0)) (.cse28 (= ~c_last_read~0 ~p_last_write~0)) (.cse36 (= ~c_num_read~0 0)) (.cse32 (= ~t1_i~0 1)) (.cse27 (= ~p_num_write~0 0)) (.cse33 (= ~p_last_write~0 ~q_buf_0~0)) (.cse41 (= 2 ~M_E~0)) (.cse38 (not .cse0)) (.cse39 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse40 (= ~m_i~0 1)) (.cse42 (not .cse12)) (.cse43 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse49 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse44 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse45 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse46 (= ~c_dr_pc~0 0)) (.cse47 (= ~p_dw_st~0 0)) (.cse48 (not .cse18))) (let ((.cse22 (and .cse38 .cse39 .cse40 .cse42 .cse43 .cse49 .cse44 .cse45 .cse35 .cse46 .cse47 .cse48)) (.cse25 (not (<= ~token~0 (+ ~local~0 1)))) (.cse26 (not (< ~local~0 ~token~0))) (.cse2 (not (= |old(~t1_st~0)| 0))) (.cse3 (and .cse38 .cse39 .cse41 .cse44 .cse46 .cse47 .cse48 .cse40 .cse42 .cse43 .cse45 .cse35 (= ~t1_st~0 0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse16 (not (= ~m_pc~0 0))) (.cse23 (= ~E_1~0 1)) (.cse1 (not .cse33)) (.cse4 (not .cse40)) (.cse6 (not (= ~token~0 ~local~0))) (.cse7 (not .cse27)) (.cse8 (not .cse32)) (.cse21 (not (= ~t1_pc~0 1))) (.cse9 (not .cse36)) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not .cse28)) (.cse13 (= 0 |old(~m_st~0)|)) (.cse14 (not .cse47)) (.cse15 (not .cse29)) (.cse17 (not .cse41)) (.cse19 (not .cse37)) (.cse20 (not .cse46)) (.cse24 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse23 .cse24) (or .cse0 .cse1 .cse4 .cse25 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse26 .cse19 .cse20 .cse23 .cse24) (let ((.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse31 (not .cse23)) (.cse34 (or (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse35 .cse46 .cse47 .cse48) (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (= ~E_M~0 1) .cse45 .cse46 .cse47 .cse48)))) (or .cse0 .cse1 .cse4 .cse25 .cse7 .cse8 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse26 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= ~m_st~0 0) .cse33 .cse34 .cse36 .cse37) .cse19 (not (< 0 ~E_M~0)) .cse20 .cse23)) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23) (or .cse0 .cse1 .cse4 .cse6 .cse7 (and .cse49 .cse35) .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse24))))) [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L854 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse29 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse30 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse2 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse14 (not (= ~m_pc~0 0))) (.cse15 (and .cse29 .cse30 .cse28 (= ~t1_st~0 0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse26 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~E_1~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= ~m_i~0 1))) (.cse21 (not (<= ~token~0 (+ ~local~0 1)))) (.cse22 (and .cse29 .cse30 .cse27 .cse28)) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse23 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (= ~T1_E~0 0)) (.cse24 (= 0 |old(~m_st~0)|)) (.cse12 (not (= ~p_dw_st~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse16 (not (= 2 ~M_E~0))) (.cse17 (= ~T1_E~0 1)) (.cse25 (not (< ~local~0 ~token~0))) (.cse18 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= ~c_dr_pc~0 0))) (.cse20 (= ~E_1~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse21 .cse22 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse17 .cse25 .cse18 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse3 .cse22 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse17 .cse18 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse22 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse3 .cse21 .cse22 .cse6 (and .cse27 (= ~E_M~0 1) .cse28) .cse7 .cse23 .cse8 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse25 .cse18 (not (< 0 ~E_M~0)) .cse19 .cse20)))) [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2021-12-16 02:30:28,705 INFO L858 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2021-12-16 02:30:28,706 INFO L854 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse15 (= ~T1_E~0 1)) (.cse11 (= ~T1_E~0 0)) (.cse0 (= ~E_1~0 0))) (let ((.cse30 (= ~p_dw_pc~0 0)) (.cse22 (= ~q_free~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= ~c_num_read~0 0)) (.cse25 (= ~t1_i~0 1)) (.cse20 (= ~p_num_write~0 0)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse37 (= 2 ~M_E~0)) (.cse35 (not .cse0)) (.cse36 (= ~m_i~0 1)) (.cse38 (not .cse11)) (.cse39 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse48 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse40 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse41 (= ~c_dr_pc~0 0)) (.cse42 (= ~p_dw_st~0 0)) (.cse43 (not .cse15))) (let ((.cse31 (not (<= ~token~0 (+ ~local~0 1)))) (.cse5 (and .cse35 .cse36 .cse38 .cse39 .cse48 .cse40 .cse28 .cse41 .cse42 .cse43)) (.cse33 (not (< ~local~0 ~token~0))) (.cse18 (= ~E_1~0 1)) (.cse44 (not (= |old(~t1_st~0)| 0))) (.cse45 (not (<= ~t1_pc~0 0))) (.cse46 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse28 .cse41 .cse42 (= ~t1_st~0 0) .cse43)) (.cse47 (not (= ~m_pc~0 0))) (.cse1 (not .cse26)) (.cse2 (not .cse36)) (.cse3 (not (= ~token~0 ~local~0))) (.cse4 (not .cse20)) (.cse6 (not .cse25)) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (not .cse29)) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not .cse21)) (.cse12 (= 0 |old(~m_st~0)|)) (.cse13 (not .cse42)) (.cse14 (not .cse22)) (.cse32 (not .cse37)) (.cse16 (not .cse30)) (.cse17 (not .cse41)) (.cse19 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (not .cse18)) (.cse27 (let ((.cse34 (<= 1 ~t1_pc~0))) (or (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= ~E_M~0 1) .cse40 .cse41 .cse42 .cse43) (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse28 .cse41 .cse42 .cse43))))) (or .cse0 .cse1 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse20 .cse21 .cse22 .cse23 .cse24 (= ~m_st~0 0) .cse25 .cse26 .cse27 .cse29 .cse30) .cse2 .cse31 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse15 .cse33 .cse16 (not (< 0 ~E_M~0)) .cse17 .cse18)) (or .cse0 .cse1 .cse2 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse44 .cse2 .cse45 .cse3 .cse4 .cse46 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse47 .cse32 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse44 .cse2 .cse45 .cse3 .cse4 .cse46 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse47 .cse32 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse48 .cse28) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse15 .cse16 .cse17 .cse19))))) [2021-12-16 02:30:28,706 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2021-12-16 02:30:28,706 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2021-12-16 02:30:28,706 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2021-12-16 02:30:28,706 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,706 INFO L854 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,706 INFO L854 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0)) (.cse22 (= ~m_pc~0 0)) (.cse25 (<= ~token~0 (+ ~local~0 1))) (.cse26 (< ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 1)) (.cse24 (<= 2 ~t1_st~0)) (.cse0 (= ~token~0 ~local~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~E_1~0 0))) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~T1_E~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~q_free~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse13 (not (= 0 ~m_st~0))) (.cse21 (<= ~t1_pc~0 0)) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~m_i~0 1)) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (= ~c_num_read~0 0)) (.cse19 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse21 .cse14 .cse15 .cse16 .cse17 .cse19 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse24) (and .cse1 .cse25 .cse2 .cse3 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and .cse1 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse19))) [2021-12-16 02:30:28,706 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 02:30:28,706 INFO L854 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse5 (= 2 ~c_dr_st~0)) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse6 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse15 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,706 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2021-12-16 02:30:28,706 INFO L858 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2021-12-16 02:30:28,706 INFO L858 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2021-12-16 02:30:28,706 INFO L854 garLoopResultBuilder]: At program point L780(lines 764 782) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2021-12-16 02:30:28,707 INFO L854 garLoopResultBuilder]: At program point L483(lines 454 489) the Hoare annotation is: (let ((.cse12 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ~p_dw_pc~0 0)) (.cse10 (= ~q_free~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= ~E_1~0 1))) (.cse14 (= ~m_i~0 1)) (.cse15 (not (= ~T1_E~0 0))) (.cse16 (= ~c_num_read~0 0)) (.cse17 (= ~t1_pc~0 1)) (.cse18 (<= 2 ~t1_st~0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ~m_st~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~m_pc~0 0) .cse18) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 (< ~local~0 ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-12-16 02:30:28,707 INFO L854 garLoopResultBuilder]: At program point L318(lines 302 320) the Hoare annotation is: (let ((.cse5 (= 2 ~c_dr_st~0)) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse6 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse15 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2021-12-16 02:30:28,707 INFO L854 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_M~0 1))) (.cse2 (not (= ~E_1~0 0))) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ~p_dw_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (not (= ~E_1~0 1))) (.cse13 (not (= ~T1_E~0 0))) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse16 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~p_dw_st~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2021-12-16 02:30:28,707 INFO L854 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~p_num_write~0 0) (<= ~token~0 (+ ~local~0 1)) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (< ~local~0 ~token~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (not (= 0 ~m_st~0)) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_pc~0 1) (<= 2 ~t1_st~0)) [2021-12-16 02:30:28,707 INFO L854 garLoopResultBuilder]: At program point L798-1(lines 795 835) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~E_1~0 0))) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ~p_dw_pc~0 0)) (.cse10 (= ~q_free~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse17 (= ~t1_pc~0 1)) (.cse18 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ~M_E~0) (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~t1_pc~0 0) .cse12 .cse13 .cse14 .cse15 (= ~t1_st~0 0) (= ~m_pc~0 0)) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 .cse4 .cse5 (< ~local~0 ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18))) [2021-12-16 02:30:28,707 INFO L854 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (not (= ~E_M~0 1)) (not (= ~E_1~0 0)) (= ~m_st~0 0) (= 2 ~M_E~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (<= 2 ~p_dw_st~0) (not (= ~T1_E~0 1)) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (not (= ~T1_E~0 0)) (= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2021-12-16 02:30:28,707 INFO L858 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L854 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= 2 ~c_dr_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~T1_E~0 0))) (.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_dw_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L854 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse12 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ~p_dw_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_free~0 0)) (.cse13 (not (= ~E_1~0 1))) (.cse14 (= ~m_i~0 1)) (.cse15 (not (= ~T1_E~0 0))) (.cse16 (= ~c_num_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 ~m_st~0)) .cse14 .cse15 .cse16) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 (< ~local~0 ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16))) [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L854 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L854 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse5 (= 2 ~c_dr_st~0)) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse6 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse15 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2021-12-16 02:30:28,708 INFO L854 garLoopResultBuilder]: At program point L851(lines 842 853) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-12-16 02:30:28,709 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-12-16 02:30:28,709 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~q_free~0 1)) (.cse13 (= 2 ~c_dr_st~0)) (.cse5 (not (= ~T1_E~0 1))) (.cse7 (<= ~t1_pc~0 0)) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~T1_E~0 0))) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~m_pc~0 0))) (or (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~p_num_write~0 0) .cse0 .cse1 .cse3 .cse2 .cse4 .cse12 (= ~c_dr_pc~0 0) .cse5 (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse7 .cse8 .cse9 (= ~c_num_read~0 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse5 .cse7 .cse8 .cse9 (= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11))) [2021-12-16 02:30:28,709 INFO L854 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0)) (.cse22 (= ~m_pc~0 0)) (.cse25 (<= ~token~0 (+ ~local~0 1))) (.cse26 (< ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 1)) (.cse24 (<= 2 ~t1_st~0)) (.cse0 (= ~token~0 ~local~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~E_1~0 0))) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~T1_E~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~q_free~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse13 (not (= 0 ~m_st~0))) (.cse21 (<= ~t1_pc~0 0)) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~m_i~0 1)) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (= ~c_num_read~0 0)) (.cse19 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse21 .cse14 .cse15 .cse16 .cse17 .cse19 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse24) (and .cse1 .cse25 .cse2 .cse3 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and .cse1 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse19))) [2021-12-16 02:30:28,709 INFO L854 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ~p_dw_pc~0 0)) (.cse10 (= ~q_free~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse13 (not (= 0 ~m_st~0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~m_i~0 1)) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (= ~c_num_read~0 0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~t1_pc~0 0) .cse14 .cse15 .cse16 .cse17 (= ~t1_st~0 0) (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~t1_pc~0 1) (<= 2 ~t1_st~0)))) [2021-12-16 02:30:28,709 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= 2 ~M_E~0)) (.cse3 (= ~m_st~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (= ~q_free~0 0)) (.cse7 (<= ~t1_pc~0 0)) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~T1_E~0 0))) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5 (= ~p_dw_pc~0 0) (= ~p_num_write~0 1) .cse6 .cse7 .cse8 .cse9 (= ~c_num_read~0 0) .cse10 .cse11) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 (= 2 ~c_dr_st~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-12-16 02:30:28,709 INFO L858 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2021-12-16 02:30:28,709 INFO L858 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2021-12-16 02:30:28,709 INFO L854 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-12-16 02:30:28,709 INFO L858 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2021-12-16 02:30:28,709 INFO L854 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,709 INFO L858 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2021-12-16 02:30:28,709 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2021-12-16 02:30:28,709 INFO L854 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse5 (= 2 ~c_dr_st~0)) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse6 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse15 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,709 INFO L858 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L854 garLoopResultBuilder]: At program point L391(lines 386 393) the Hoare annotation is: false [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L854 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (<= ~t1_pc~0 0)) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_pc~0 0))) (or (and (= ~p_num_write~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5 (= ~p_dw_pc~0 0) .cse6 .cse7 .cse8 (= ~c_num_read~0 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~c_dr_st~0) .cse5 .cse6 .cse7 .cse8 (= ~p_num_write~0 ~c_num_read~0) .cse9 .cse10))) [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L854 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 208) the Hoare annotation is: (and (not (= ~E_M~0 1)) (not (= ~E_1~0 0)) (= ~p_num_write~0 (+ ~c_num_read~0 1)) (= ~m_st~0 0) (= 2 ~M_E~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~p_dw_st~0) (not (= ~T1_E~0 1)) (= ~q_free~0 0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (not (= ~T1_E~0 0)) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,710 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2021-12-16 02:30:28,710 INFO L861 garLoopResultBuilder]: At program point L376(lines 367 378) the Hoare annotation is: true [2021-12-16 02:30:28,711 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2021-12-16 02:30:28,711 INFO L854 garLoopResultBuilder]: At program point L723(lines 717 725) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,711 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2021-12-16 02:30:28,711 INFO L854 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,711 INFO L858 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2021-12-16 02:30:28,711 INFO L854 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2021-12-16 02:30:28,711 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2021-12-16 02:30:28,711 INFO L858 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2021-12-16 02:30:28,711 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2021-12-16 02:30:28,711 INFO L854 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~T1_E~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~c_dr_st~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-12-16 02:30:28,711 INFO L854 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~token~0 ~local~0) (= ~p_num_write~0 0) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~m_st~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,713 INFO L858 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2021-12-16 02:30:28,713 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-12-16 02:30:28,713 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2021-12-16 02:30:28,713 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2021-12-16 02:30:28,713 INFO L854 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse5 (= 2 ~c_dr_st~0)) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse6 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse15 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,713 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 02:30:28,713 INFO L854 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse5 (= 2 ~c_dr_st~0)) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse6 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse15 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,714 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2021-12-16 02:30:28,714 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2021-12-16 02:30:28,714 INFO L858 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2021-12-16 02:30:28,714 INFO L854 garLoopResultBuilder]: At program point L462(lines 457 488) the Hoare annotation is: (and (= ~token~0 ~local~0) (= ~p_num_write~0 0) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= 0 ~m_st~0)) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_pc~0 1)) [2021-12-16 02:30:28,714 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= ~token~0 ~local~0) (= ~p_num_write~0 0) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~m_st~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,714 INFO L854 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (and (= ~p_num_write~0 0) (< 0 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (not (= ~E_1~0 0)) (= 2 ~M_E~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (< ~local~0 ~token~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= 0 ~m_st~0)) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_pc~0 1)) [2021-12-16 02:30:28,714 INFO L858 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2021-12-16 02:30:28,714 INFO L854 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~token~0 ~local~0) (= ~p_num_write~0 0) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~m_st~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,715 INFO L854 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~token~0 ~local~0) (= ~p_num_write~0 0) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~m_st~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,715 INFO L854 garLoopResultBuilder]: At program point L364(lines 350 366) the Hoare annotation is: (and (= ~p_num_write~0 0) (not (= ~E_M~0 1)) (not (= ~E_1~0 0)) (= 2 ~M_E~0) (= ~m_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,715 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,715 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2021-12-16 02:30:28,715 INFO L854 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse5 (= 2 ~c_dr_st~0)) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse6 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse3 .cse2 .cse4 .cse14 .cse18 .cse15 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,715 INFO L854 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,716 INFO L854 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse19 (= ~t1_pc~0 1)) (.cse0 (= ~token~0 ~local~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~E_1~0 0))) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~T1_E~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~q_free~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse14 (not (= 0 ~m_st~0))) (.cse15 (not (= ~E_1~0 1))) (.cse16 (= ~m_i~0 1)) (.cse17 (not (= ~T1_E~0 0))) (.cse18 (= ~c_num_read~0 0)) (.cse20 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 2 ~t1_st~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ~t1_pc~0 0) .cse15 .cse16 .cse17 .cse18 .cse20))) [2021-12-16 02:30:28,716 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2021-12-16 02:30:28,716 INFO L854 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~token~0 ~local~0) (= ~p_num_write~0 0) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~m_st~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,716 INFO L854 garLoopResultBuilder]: At program point L761(lines 754 763) the Hoare annotation is: (and (= ~token~0 ~local~0) (= ~p_num_write~0 0) (not (= ~E_1~0 0)) (<= 2 ~E_M~0) (= 2 ~M_E~0) (= ~m_st~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~p_dw_st~0 0) (not (= ~T1_E~0 1)) (= ~p_dw_pc~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~t1_pc~0 0) (not (= ~E_1~0 1)) (= ~m_i~0 1) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0)) [2021-12-16 02:30:28,716 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-12-16 02:30:28,716 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~E_1~0 0))) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~M_E~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~T1_E~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~q_free~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse14 (not (= 0 ~m_st~0))) (.cse15 (= ~m_i~0 1)) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (= ~c_num_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~t1_pc~0 1) (<= 2 ~t1_st~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ~t1_pc~0 0) .cse15 .cse16 .cse17 (= ~t1_st~0 0) (= ~m_pc~0 0)))) [2021-12-16 02:30:28,716 INFO L858 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2021-12-16 02:30:28,716 INFO L858 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2021-12-16 02:30:28,717 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,717 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2021-12-16 02:30:28,717 INFO L854 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 (< ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-12-16 02:30:28,717 INFO L854 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~T1_E~0 0))) (.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_dw_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse2 .cse3 .cse4 .cse14 .cse6 (= ~q_free~0 0) .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-16 02:30:28,717 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 228 247) no Hoare annotation was computed. [2021-12-16 02:30:28,717 INFO L861 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: true [2021-12-16 02:30:28,717 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2021-12-16 02:30:28,717 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2021-12-16 02:30:28,718 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2021-12-16 02:30:28,718 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2021-12-16 02:30:28,718 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-12-16 02:30:28,718 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-12-16 02:30:28,718 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2021-12-16 02:30:28,718 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-12-16 02:30:28,718 INFO L854 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: (let ((.cse15 (= 0 ~m_st~0)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse11 (not (= ~t1_st~0 0))) (.cse0 (= ~E_1~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (<= 1 exists_runnable_thread2_~__retres1~6)) (.cse21 (not (= ~m_st~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse22 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (= ~T1_E~0 0)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse24 (not (= ~m_pc~0 0))) (.cse23 (not (<= 2 ~t1_st~0))) (.cse16 (not (= 2 ~M_E~0))) (.cse17 (= ~T1_E~0 1)) (.cse18 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= ~c_dr_pc~0 0))) (.cse20 (= ~E_1~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse3 (not (<= ~token~0 (+ ~local~0 1))) .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse23 .cse16 .cse17 (not (< ~local~0 ~token~0)) .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse24 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 554 573) no Hoare annotation was computed. [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2021-12-16 02:30:28,719 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2021-12-16 02:30:28,719 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2021-12-16 02:30:28,720 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 653 680) the Hoare annotation is: (let ((.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~T1_E~0 |old(~T1_E~0)|))) (let ((.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (= |old(~E_1~0)| 0)) (.cse2 (not (= ~m_i~0 1))) (.cse6 (= |old(~T1_E~0)| 1)) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~T1_E~0)| 0)) (.cse10 (not (= ~t1_i~0 1))) (.cse19 (not (= ~t1_pc~0 1))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (= |old(~E_1~0)| 1)) (.cse20 (and (= ~M_E~0 |old(~M_E~0)|) .cse3 .cse4 .cse5)) (.cse21 (= 0 ~m_st~0)) (.cse16 (not (<= 2 |old(~E_M~0)|))) (.cse22 (not (<= 2 ~t1_st~0))) (.cse17 (not (= ~p_dw_pc~0 0))) (.cse18 (not (= ~c_dr_pc~0 0)))) (and (or .cse0 (not (= ~m_st~0 0)) .cse1 .cse2 (not (= 2 |old(~M_E~0)|)) (and .cse3 .cse4 (= 2 ~M_E~0) .cse5) .cse6 (not (<= ~t1_pc~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~t1_st~0 0)) .cse13 .cse14 .cse15 (not (= ~m_pc~0 0)) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse22 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse6 (not (<= ~token~0 (+ ~local~0 1))) .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse21 .cse16 .cse22 (not (< ~local~0 ~token~0)) .cse17 .cse18)))) [2021-12-16 02:30:28,720 INFO L858 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2021-12-16 02:30:28,722 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:30:28,724 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 02:30:28,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:30:28 BoogieIcfgContainer [2021-12-16 02:30:28,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 02:30:28,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 02:30:28,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 02:30:28,790 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 02:30:28,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:29:32" (3/4) ... [2021-12-16 02:30:28,792 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 02:30:28,796 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-16 02:30:28,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2021-12-16 02:30:28,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-12-16 02:30:28,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-12-16 02:30:28,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-12-16 02:30:28,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-12-16 02:30:28,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-12-16 02:30:28,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-12-16 02:30:28,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-12-16 02:30:28,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-12-16 02:30:28,807 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-16 02:30:28,807 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 02:30:28,807 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 02:30:28,827 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(p_num_write == 0)) || ((t1_st == \old(t1_st) && E_M == 1) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1) [2021-12-16 02:30:28,827 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || ((t1_st == \old(t1_st) && E_M == 1) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1) && ((((((((((((((((((((E_1 == 0 || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0)) || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0)) || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st))) [2021-12-16 02:30:28,832 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || (((((((((!(E_1 == 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st))) && (((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && t1_i == 1) && p_last_write == q_buf_0) && (((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || ((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && m_st == \old(m_st)) && c_num_read == 0) && p_dw_pc == 0)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && m_st == 0) && t1_i == 1) && p_last_write == q_buf_0) && (((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || ((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && c_num_read == 0) && p_dw_pc == 0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || (((((((((!(E_1 == 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || ((((((((((!(E_1 == 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && t1_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || ((((((((((!(E_1 == 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && t1_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st))) [2021-12-16 02:30:28,833 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || ((((((((((((!(E_1 == 0) && \result <= 0) && 2 == M_E) && 0 <= \result) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && (((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && t1_i == 1) && p_last_write == q_buf_0) && ((((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && m_st == \old(m_st)) && c_num_read == 0) && p_dw_pc == 0)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && t1_i == 1) && m_st == 0) && p_last_write == q_buf_0) && ((((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && c_num_read == 0) && p_dw_pc == 0)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || ((((((((((((!(E_1 == 0) && \result <= 0) && 2 == M_E) && 0 <= \result) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st))) [2021-12-16 02:30:28,835 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1) && (((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || !(p_dw_pc == 0)) || E_1 == 1)) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1)) && ((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || (((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) [2021-12-16 02:30:28,835 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(p_num_write == 1)) || (((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) && (((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1)) && (((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || !(p_dw_pc == 0)) || E_1 == 1)) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1) [2021-12-16 02:30:28,835 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) || E_1 == 1) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1)) && ((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(t1_pc <= 0)) || !(p_num_write == 1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1) [2021-12-16 02:30:28,835 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) || E_1 == 1) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1)) && ((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(t1_pc <= 0)) || !(p_num_write == 1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1) [2021-12-16 02:30:28,883 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 02:30:28,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 02:30:28,884 INFO L158 Benchmark]: Toolchain (without parser) took 57474.28ms. Allocated memory was 90.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 57.4MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2021-12-16 02:30:28,884 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory was 47.2MB in the beginning and 47.2MB in the end (delta: 11.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 02:30:28,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.55ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 57.2MB in the beginning and 96.1MB in the end (delta: -38.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 02:30:28,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.37ms. Allocated memory is still 123.7MB. Free memory was 96.1MB in the beginning and 93.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 02:30:28,886 INFO L158 Benchmark]: Boogie Preprocessor took 71.53ms. Allocated memory is still 123.7MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:30:28,886 INFO L158 Benchmark]: RCFGBuilder took 518.54ms. Allocated memory is still 123.7MB. Free memory was 91.1MB in the beginning and 70.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-16 02:30:28,886 INFO L158 Benchmark]: TraceAbstraction took 56205.82ms. Allocated memory was 123.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 69.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 890.9MB. Max. memory is 16.1GB. [2021-12-16 02:30:28,890 INFO L158 Benchmark]: Witness Printer took 93.75ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-16 02:30:28,893 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory was 47.2MB in the beginning and 47.2MB in the end (delta: 11.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.55ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 57.2MB in the beginning and 96.1MB in the end (delta: -38.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.37ms. Allocated memory is still 123.7MB. Free memory was 96.1MB in the beginning and 93.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.53ms. Allocated memory is still 123.7MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.54ms. Allocated memory is still 123.7MB. Free memory was 91.1MB in the beginning and 70.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 56205.82ms. Allocated memory was 123.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 69.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 890.9MB. Max. memory is 16.1GB. * Witness Printer took 93.75ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 56.1s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10005 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9722 mSDsluCounter, 17486 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10898 mSDsCounter, 1828 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6622 IncrementalHoareTripleChecker+Invalid, 8450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1828 mSolverCounterUnsat, 6588 mSDtfsCounter, 6622 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1937 GetRequests, 1670 SyntacticMatches, 2 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4171occurred in iteration=25, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 3249 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 5073 PreInvPairs, 5413 NumberOfFragments, 13351 HoareAnnotationTreeSize, 5073 FomulaSimplifications, 2255 FormulaSimplificationTreeSizeReduction, 24.2s HoareSimplificationTime, 72 FomulaSimplificationsInter, 4309529 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3225 NumberOfCodeBlocks, 3225 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3487 ConstructedInterpolants, 0 QuantifiedInterpolants, 6665 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3209 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 39 InterpolantComputations, 26 PerfectInterpolantSequences, 1502/1621 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: (((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((((((p_num_write == 0 && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && m_st == 0) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && m_pc == 0) && 2 <= t1_st)) || (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 <= p_dw_st) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || ((t1_st == \old(t1_st) && E_M == 1) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1) && ((((((((((((((((((((E_1 == 0 || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0)) || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0)) || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st))) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(p_num_write == 0)) || ((t1_st == \old(t1_st) && E_M == 1) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && t1_pc <= 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0) || (((((((((((((((((((p_num_write == 0 && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) || E_1 == 1) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1)) && ((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(t1_pc <= 0)) || !(p_num_write == 1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0 - 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_num_write == 0 && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && q_free == 0) && 1 <= tmp) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && m_pc == 0) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && 2 == M_E) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && q_free == 0) && 1 <= tmp) && !(E_1 == 1)) && !(0 == m_st)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0)) || (((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && 2 == M_E) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && q_free == 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && t1_st == 0) || ((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && m_st == 0) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || ((((((((((((((((((((p_num_write == 0 && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && m_st == 0) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && m_pc == 0) && 2 <= t1_st)) || (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st)) || (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && t1_pc <= 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1) && (((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || !(p_dw_pc == 0)) || E_1 == 1)) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1)) && ((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || (((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 <= p_dw_st) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(p_num_write == 1)) || (((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) && (((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1)) && (((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || !(p_dw_pc == 0)) || E_1 == 1)) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || (p_dw_st == \old(p_dw_st) && c_dr_st == \old(c_dr_st))) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || T1_E == 1) || !(2 == M_E)) || ((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(p_dw_pc == 0)) || E_1 == 1) && ((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(2 == \old(c_dr_st))) || !(m_st == 0)) || ((p_dw_st == \old(p_dw_st) || p_dw_st == 0) && 2 == c_dr_st)) || E_M == 1) || !(t1_pc <= 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(p_num_write == c_num_read + 1)) || !(2 == M_E)) || T1_E == 1) || E_1 == 1)) && ((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_st == 0)) || E_M == 1) || (((((((p_dw_st == \old(p_dw_st) && __retres1 <= 0) && tmp <= 0) && \result <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= \result) && 0 <= __retres1) && 0 < tmp + 1)) || !(t1_pc <= 0)) || !(p_num_write == 1)) || !(c_num_read == 0)) || !(t1_st == 0)) || T1_E == 0) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((!(p_last_write == q_buf_0) || E_1 == 0) || !(p_num_write == c_num_read)) || !(q_free == 1)) || !(m_st == 0)) || E_M == 1) || !(t1_pc <= 0)) || p_dw_st == 0) || (((p_dw_st == \old(p_dw_st) && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(t1_st == 0)) || !(m_pc == 0)) || T1_E == 1) || !(2 == M_E)) || !(2 <= \old(p_dw_st))) || E_1 == 1) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || (((((((((!(E_1 == 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st))) && (((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && t1_i == 1) && p_last_write == q_buf_0) && (((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || ((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && m_st == \old(m_st)) && c_num_read == 0) && p_dw_pc == 0)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && m_st == 0) && t1_i == 1) && p_last_write == q_buf_0) && (((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || ((((((((((1 <= t1_pc && !(E_1 == 0)) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && c_num_read == 0) && p_dw_pc == 0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || (((((((((!(E_1 == 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || ((((((((((!(E_1 == 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && t1_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || ((((((((((!(E_1 == 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && t1_st == 0) && !(T1_E == 1))) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0))) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st))) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 <= p_dw_st) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || 1 <= __retres1) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || !(t1_st == 0)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || 0 == m_st) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) && (((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || 1 <= __retres1) || !(m_st == 0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 <= t1_st)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || 1 <= __retres1) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || !(t1_st == 0)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || 0 == m_st) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || 1 <= __retres1) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || !(t1_st == 0)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || 1 <= __retres1) || !(m_st == 0)) || !(m_i == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 <= t1_st)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && !(T1_E == 1)) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0)) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) && !(T1_E == 1)) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && c_dr_pc == 0) && !(T1_E == 1)) && p_dw_pc == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0) || ((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 <= p_dw_st) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) || ((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || ((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0)) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 <= p_dw_st) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && m_st == 0) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0 - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 <= p_dw_st) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || ((((((((((((((!(E_M == 1) && !(E_1 == 0)) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && q_free == 1) && 2 == c_dr_st) && 2 <= p_dw_st) && !(T1_E == 1)) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && p_num_write == c_num_read) && t1_st == 0) && m_pc == 0)) || (((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0)) || (((((((((((((!(E_M == 1) && !(E_1 == 0)) && p_num_write == c_num_read + 1) && m_st == 0) && 2 == M_E) && p_last_write == q_buf_0) && 2 <= p_dw_st) && !(T1_E == 1)) && q_free == 0) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && m_pc == 0) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && t1_st == 0)) || ((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && 1 <= tmp) && !(0 == m_st)) && t1_pc <= 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && !(E_M == 1)) && !(E_1 == 0)) && 2 == M_E) && m_st == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && m_st == 0) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || ((((((((((((!(E_1 == 0) && \result <= 0) && 2 == M_E) && 0 <= \result) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(m_i == 1)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && t1_st == \old(t1_st)) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1))) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || T1_E == 1) || !(local < token)) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1) || !(2 <= \old(t1_st)))) && (((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token <= local + 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && t1_i == 1) && p_last_write == q_buf_0) && ((((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && m_st == \old(m_st)) && c_num_read == 0) && p_dw_pc == 0)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(local < token)) || ((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_free == 0) && \old(t1_st) == t1_st) && !(E_1 == 1)) && t1_i == 1) && m_st == 0) && p_last_write == q_buf_0) && ((((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) || (((((((((((!(E_1 == 0) && \result <= 0) && m_i == 1) && 2 == M_E) && !(T1_E == 0)) && 0 <= __retres1) && 0 <= \result) && E_M == 1) && __retres1 <= 0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)))) && c_num_read == 0) && p_dw_pc == 0)) || !(p_dw_pc == 0)) || !(0 < E_M)) || !(c_dr_pc == 0)) || E_1 == 1)) && ((((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || ((((((((((((!(E_1 == 0) && \result <= 0) && 2 == M_E) && 0 <= \result) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && m_i == 1) && !(T1_E == 0)) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(t1_pc <= 0)) || !(token == local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || !(p_dw_st == 0)) || !(q_free == 0)) || !(m_pc == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || E_1 == 1)) && (((((((((((((((((((E_1 == 0 || !(p_last_write == q_buf_0)) || !(m_i == 1)) || !(token == local)) || !(p_num_write == 0)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_last_read == p_last_write)) || T1_E == 0) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(q_free == 0)) || !(2 == M_E)) || T1_E == 1) || !(p_dw_pc == 0)) || !(c_dr_pc == 0)) || !(2 <= \old(t1_st))) - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: (((((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && 2 == M_E) && m_st == 0) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && t1_pc <= 0) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_st == 0) && m_pc == 0) || (((((((((((((((((((p_num_write == 0 && token <= local + 1) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && local < token) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st)) || ((((((((((((((((((token == local && p_num_write == 0) && !(E_1 == 0)) && 2 <= E_M) && t1_i == 1) && p_last_write == q_buf_0) && c_dr_pc == 0) && p_dw_st == 0) && !(T1_E == 1)) && p_dw_pc == 0) && q_free == 0) && c_last_read == p_last_write) && !(0 == m_st)) && !(E_1 == 1)) && m_i == 1) && !(T1_E == 0)) && c_num_read == 0) && t1_pc == 1) && 2 <= t1_st) RESULT: Ultimate proved your program to be correct! [2021-12-16 02:30:28,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE