/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 08:17:58,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 08:17:58,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 08:17:58,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 08:17:58,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 08:17:58,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 08:17:58,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 08:17:59,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 08:17:59,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 08:17:59,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 08:17:59,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 08:17:59,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 08:17:59,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 08:17:59,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 08:17:59,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 08:17:59,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 08:17:59,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 08:17:59,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 08:17:59,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 08:17:59,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 08:17:59,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 08:17:59,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 08:17:59,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 08:17:59,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 08:17:59,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 08:17:59,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 08:17:59,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 08:17:59,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 08:17:59,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 08:17:59,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 08:17:59,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 08:17:59,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 08:17:59,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 08:17:59,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 08:17:59,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 08:17:59,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 08:17:59,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 08:17:59,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 08:17:59,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 08:17:59,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 08:17:59,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 08:17:59,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 08:17:59,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 08:17:59,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 08:17:59,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 08:17:59,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 08:17:59,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 08:17:59,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 08:17:59,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 08:17:59,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 08:17:59,071 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 08:17:59,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 08:17:59,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 08:17:59,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 08:17:59,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 08:17:59,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 08:17:59,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 08:17:59,072 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 08:17:59,072 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 08:17:59,072 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 08:17:59,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 08:17:59,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 08:17:59,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 08:17:59,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 08:17:59,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 08:17:59,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:17:59,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 08:17:59,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 08:17:59,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 08:17:59,074 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 08:17:59,074 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 08:17:59,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 08:17:59,075 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 08:17:59,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 08:17:59,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 08:17:59,075 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 08:17:59,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 08:17:59,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 08:17:59,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 08:17:59,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 08:17:59,317 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 08:17:59,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 08:17:59,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71b71030/4c584888a133428da8fe4ba0621f20c8/FLAG4852f2879 [2022-01-10 08:17:59,844 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 08:17:59,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 08:17:59,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71b71030/4c584888a133428da8fe4ba0621f20c8/FLAG4852f2879 [2022-01-10 08:17:59,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71b71030/4c584888a133428da8fe4ba0621f20c8 [2022-01-10 08:17:59,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 08:17:59,883 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 08:17:59,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 08:17:59,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 08:17:59,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 08:17:59,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:17:59" (1/1) ... [2022-01-10 08:17:59,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2ca0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:17:59, skipping insertion in model container [2022-01-10 08:17:59,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:17:59" (1/1) ... [2022-01-10 08:17:59,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 08:17:59,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 08:18:00,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-01-10 08:18:00,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-01-10 08:18:00,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:18:00,167 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 08:18:00,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-01-10 08:18:00,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-01-10 08:18:00,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:18:00,225 INFO L208 MainTranslator]: Completed translation [2022-01-10 08:18:00,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00 WrapperNode [2022-01-10 08:18:00,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 08:18:00,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 08:18:00,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 08:18:00,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 08:18:00,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,272 INFO L137 Inliner]: procedures = 51, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 398 [2022-01-10 08:18:00,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 08:18:00,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 08:18:00,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 08:18:00,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 08:18:00,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 08:18:00,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 08:18:00,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 08:18:00,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 08:18:00,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (1/1) ... [2022-01-10 08:18:00,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:18:00,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 08:18:00,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 08:18:00,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 08:18:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 08:18:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 08:18:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 08:18:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-01-10 08:18:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-01-10 08:18:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 08:18:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 08:18:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 08:18:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 08:18:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 08:18:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 08:18:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 08:18:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 08:18:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 08:18:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 08:18:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 08:18:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 08:18:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 08:18:00,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 08:18:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 08:18:00,379 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 08:18:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 08:18:00,478 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 08:18:00,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 08:18:00,783 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 08:18:00,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 08:18:00,792 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 08:18:00,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:18:00 BoogieIcfgContainer [2022-01-10 08:18:00,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 08:18:00,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 08:18:00,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 08:18:00,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 08:18:00,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:17:59" (1/3) ... [2022-01-10 08:18:00,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dec34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:18:00, skipping insertion in model container [2022-01-10 08:18:00,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:00" (2/3) ... [2022-01-10 08:18:00,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dec34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:18:00, skipping insertion in model container [2022-01-10 08:18:00,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:18:00" (3/3) ... [2022-01-10 08:18:00,800 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 08:18:00,804 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 08:18:00,804 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 08:18:00,842 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 08:18:00,849 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 [2022-01-10 08:18:00,849 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 08:18:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-10 08:18:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 08:18:00,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:00,893 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] [2022-01-10 08:18:00,893 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:00,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2022-01-10 08:18:00,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:00,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635624043] [2022-01-10 08:18:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:00,917 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:00,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:00,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:00,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 08:18:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:01,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:01,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:01,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:01,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:01,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635624043] [2022-01-10 08:18:01,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635624043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:01,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:01,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:01,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560750546] [2022-01-10 08:18:01,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:01,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:01,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:01,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:01,259 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 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:01,327 INFO L93 Difference]: Finished difference Result 403 states and 608 transitions. [2022-01-10 08:18:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-10 08:18:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:01,341 INFO L225 Difference]: With dead ends: 403 [2022-01-10 08:18:01,341 INFO L226 Difference]: Without dead ends: 228 [2022-01-10 08:18:01,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:01,354 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 227 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:01,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 347 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-01-10 08:18:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2022-01-10 08:18:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 187 states have (on average 1.4064171122994653) internal successors, (263), 190 states have internal predecessors, (263), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2022-01-10 08:18:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 315 transitions. [2022-01-10 08:18:01,442 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 315 transitions. Word has length 44 [2022-01-10 08:18:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:01,443 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 315 transitions. [2022-01-10 08:18:01,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 315 transitions. [2022-01-10 08:18:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 08:18:01,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:01,450 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] [2022-01-10 08:18:01,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:01,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:01,655 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2022-01-10 08:18:01,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:01,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608897757] [2022-01-10 08:18:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:01,657 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:01,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:01,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:01,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 08:18:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:01,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:01,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:01,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:01,831 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:01,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608897757] [2022-01-10 08:18:01,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608897757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:01,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:01,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:01,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585817418] [2022-01-10 08:18:01,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:01,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:01,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:01,846 INFO L87 Difference]: Start difference. First operand 224 states and 315 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:01,902 INFO L93 Difference]: Finished difference Result 432 states and 603 transitions. [2022-01-10 08:18:01,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:01,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 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 45 [2022-01-10 08:18:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:01,908 INFO L225 Difference]: With dead ends: 432 [2022-01-10 08:18:01,908 INFO L226 Difference]: Without dead ends: 317 [2022-01-10 08:18:01,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:01,911 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 62 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:01,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 476 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-01-10 08:18:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2022-01-10 08:18:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 248 states have (on average 1.3991935483870968) internal successors, (347), 251 states have internal predecessors, (347), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (31), 26 states have call predecessors, (31), 26 states have call successors, (31) [2022-01-10 08:18:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2022-01-10 08:18:01,947 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 45 [2022-01-10 08:18:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:01,947 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2022-01-10 08:18:01,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2022-01-10 08:18:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 08:18:01,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:01,950 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] [2022-01-10 08:18:01,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:02,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:02,151 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:02,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2022-01-10 08:18:02,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:02,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138911095] [2022-01-10 08:18:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:02,153 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:02,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:02,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:02,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 08:18:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:02,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:02,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:02,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:02,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:02,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138911095] [2022-01-10 08:18:02,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138911095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:02,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:02,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:02,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088093471] [2022-01-10 08:18:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:02,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:02,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:02,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:02,311 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:02,349 INFO L93 Difference]: Finished difference Result 644 states and 894 transitions. [2022-01-10 08:18:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 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 45 [2022-01-10 08:18:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:02,355 INFO L225 Difference]: With dead ends: 644 [2022-01-10 08:18:02,355 INFO L226 Difference]: Without dead ends: 462 [2022-01-10 08:18:02,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:02,358 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 207 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:02,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 327 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-01-10 08:18:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 448. [2022-01-10 08:18:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 387 states have (on average 1.3669250645994833) internal successors, (529), 392 states have internal predecessors, (529), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2022-01-10 08:18:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 615 transitions. [2022-01-10 08:18:02,389 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 615 transitions. Word has length 45 [2022-01-10 08:18:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:02,389 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 615 transitions. [2022-01-10 08:18:02,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 615 transitions. [2022-01-10 08:18:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:02,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:02,393 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] [2022-01-10 08:18:02,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:02,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:02,602 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2022-01-10 08:18:02,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:02,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071585126] [2022-01-10 08:18:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:02,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:02,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:02,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:02,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 08:18:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:02,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:02,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:02,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:02,764 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:02,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071585126] [2022-01-10 08:18:02,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071585126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:02,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:02,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:02,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119218284] [2022-01-10 08:18:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:02,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:02,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:02,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:02,766 INFO L87 Difference]: Start difference. First operand 448 states and 615 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:02,792 INFO L93 Difference]: Finished difference Result 544 states and 751 transitions. [2022-01-10 08:18:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 08:18:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:02,796 INFO L225 Difference]: With dead ends: 544 [2022-01-10 08:18:02,796 INFO L226 Difference]: Without dead ends: 448 [2022-01-10 08:18:02,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:02,801 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 136 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:02,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 328 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-01-10 08:18:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2022-01-10 08:18:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 387 states have (on average 1.3643410852713178) internal successors, (528), 392 states have internal predecessors, (528), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2022-01-10 08:18:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 614 transitions. [2022-01-10 08:18:02,824 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 614 transitions. Word has length 57 [2022-01-10 08:18:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:02,826 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 614 transitions. [2022-01-10 08:18:02,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 614 transitions. [2022-01-10 08:18:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:02,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:02,827 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] [2022-01-10 08:18:02,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:03,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:03,039 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2022-01-10 08:18:03,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:03,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330192907] [2022-01-10 08:18:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:03,041 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:03,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:03,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 08:18:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:03,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:03,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:03,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:03,231 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:03,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330192907] [2022-01-10 08:18:03,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330192907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:03,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:03,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:03,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090859321] [2022-01-10 08:18:03,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:03,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:03,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:03,233 INFO L87 Difference]: Start difference. First operand 448 states and 614 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:03,547 INFO L93 Difference]: Finished difference Result 638 states and 886 transitions. [2022-01-10 08:18:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:03,548 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 08:18:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:03,552 INFO L225 Difference]: With dead ends: 638 [2022-01-10 08:18:03,553 INFO L226 Difference]: Without dead ends: 545 [2022-01-10 08:18:03,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:18:03,554 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 330 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:03,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 603 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-01-10 08:18:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 538. [2022-01-10 08:18:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 460 states have (on average 1.376086956521739) internal successors, (633), 466 states have internal predecessors, (633), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2022-01-10 08:18:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 740 transitions. [2022-01-10 08:18:03,583 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 740 transitions. Word has length 57 [2022-01-10 08:18:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:03,583 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 740 transitions. [2022-01-10 08:18:03,583 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 740 transitions. [2022-01-10 08:18:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:03,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:03,586 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] [2022-01-10 08:18:03,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:03,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:03,795 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1340236402, now seen corresponding path program 1 times [2022-01-10 08:18:03,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:03,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411728136] [2022-01-10 08:18:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:03,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:03,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:03,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 08:18:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:03,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:03,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:03,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:03,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:03,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411728136] [2022-01-10 08:18:03,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411728136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:03,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:03,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:03,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984229778] [2022-01-10 08:18:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:03,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:03,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:03,961 INFO L87 Difference]: Start difference. First operand 538 states and 740 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:04,159 INFO L93 Difference]: Finished difference Result 721 states and 1004 transitions. [2022-01-10 08:18:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:18:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 08:18:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:04,164 INFO L225 Difference]: With dead ends: 721 [2022-01-10 08:18:04,164 INFO L226 Difference]: Without dead ends: 538 [2022-01-10 08:18:04,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:18:04,167 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 277 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:04,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 458 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-10 08:18:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-01-10 08:18:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 460 states have (on average 1.3608695652173912) internal successors, (626), 466 states have internal predecessors, (626), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2022-01-10 08:18:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-01-10 08:18:04,199 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 57 [2022-01-10 08:18:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:04,199 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-01-10 08:18:04,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-01-10 08:18:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:04,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:04,201 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] [2022-01-10 08:18:04,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:04,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:04,410 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1124197770, now seen corresponding path program 1 times [2022-01-10 08:18:04,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:04,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093454340] [2022-01-10 08:18:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:04,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:04,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:04,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:04,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 08:18:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:04,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:04,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:04,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:04,581 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:04,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093454340] [2022-01-10 08:18:04,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093454340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:04,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:04,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:04,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610257408] [2022-01-10 08:18:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:04,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:04,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:04,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:04,583 INFO L87 Difference]: Start difference. First operand 538 states and 733 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:04,794 INFO L93 Difference]: Finished difference Result 759 states and 1046 transitions. [2022-01-10 08:18:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 08:18:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:04,797 INFO L225 Difference]: With dead ends: 759 [2022-01-10 08:18:04,798 INFO L226 Difference]: Without dead ends: 576 [2022-01-10 08:18:04,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:18:04,799 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 286 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:04,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 451 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-01-10 08:18:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2022-01-10 08:18:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 492 states have (on average 1.3434959349593496) internal successors, (661), 498 states have internal predecessors, (661), 51 states have call successors, (51), 31 states have call predecessors, (51), 31 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-10 08:18:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 772 transitions. [2022-01-10 08:18:04,829 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 772 transitions. Word has length 57 [2022-01-10 08:18:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:04,829 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 772 transitions. [2022-01-10 08:18:04,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 772 transitions. [2022-01-10 08:18:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:04,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:04,830 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] [2022-01-10 08:18:04,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:05,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,038 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1216775161, now seen corresponding path program 1 times [2022-01-10 08:18:05,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:05,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923838266] [2022-01-10 08:18:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:05,039 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:05,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:05,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 08:18:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:05,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:05,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:05,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:05,200 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:05,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923838266] [2022-01-10 08:18:05,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923838266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:05,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:05,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:05,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617331719] [2022-01-10 08:18:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:05,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:05,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:05,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:05,203 INFO L87 Difference]: Start difference. First operand 576 states and 772 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:05,254 INFO L93 Difference]: Finished difference Result 880 states and 1187 transitions. [2022-01-10 08:18:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:05,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 08:18:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:05,258 INFO L225 Difference]: With dead ends: 880 [2022-01-10 08:18:05,258 INFO L226 Difference]: Without dead ends: 660 [2022-01-10 08:18:05,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:05,259 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 50 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:05,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 927 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-01-10 08:18:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 588. [2022-01-10 08:18:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 504 states have (on average 1.3353174603174602) internal successors, (673), 510 states have internal predecessors, (673), 51 states have call successors, (51), 31 states have call predecessors, (51), 31 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-10 08:18:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 784 transitions. [2022-01-10 08:18:05,302 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 784 transitions. Word has length 57 [2022-01-10 08:18:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:05,303 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 784 transitions. [2022-01-10 08:18:05,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 784 transitions. [2022-01-10 08:18:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:05,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:05,304 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] [2022-01-10 08:18:05,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:05,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,513 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:05,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1289161719, now seen corresponding path program 1 times [2022-01-10 08:18:05,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:05,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282000373] [2022-01-10 08:18:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:05,514 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:05,515 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:05,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 08:18:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:05,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:05,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:05,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:05,649 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:05,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282000373] [2022-01-10 08:18:05,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282000373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:05,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:05,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:05,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430966336] [2022-01-10 08:18:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:05,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:05,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:05,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:05,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:05,652 INFO L87 Difference]: Start difference. First operand 588 states and 784 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:05,695 INFO L93 Difference]: Finished difference Result 834 states and 1111 transitions. [2022-01-10 08:18:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 08:18:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:05,699 INFO L225 Difference]: With dead ends: 834 [2022-01-10 08:18:05,699 INFO L226 Difference]: Without dead ends: 602 [2022-01-10 08:18:05,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:05,701 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 10 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:05,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 915 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-01-10 08:18:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 594. [2022-01-10 08:18:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 510 states have (on average 1.3274509803921568) internal successors, (677), 516 states have internal predecessors, (677), 51 states have call successors, (51), 31 states have call predecessors, (51), 31 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-10 08:18:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 788 transitions. [2022-01-10 08:18:05,729 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 788 transitions. Word has length 57 [2022-01-10 08:18:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:05,730 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 788 transitions. [2022-01-10 08:18:05,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 788 transitions. [2022-01-10 08:18:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:05,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:05,731 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] [2022-01-10 08:18:05,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:05,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,940 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash 634066315, now seen corresponding path program 1 times [2022-01-10 08:18:05,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:05,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824020690] [2022-01-10 08:18:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:05,941 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:05,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:05,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 08:18:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:05,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 08:18:05,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:06,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:06,101 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:06,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824020690] [2022-01-10 08:18:06,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824020690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:06,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:06,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:06,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059066850] [2022-01-10 08:18:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:06,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:06,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:06,103 INFO L87 Difference]: Start difference. First operand 594 states and 788 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:06,316 INFO L93 Difference]: Finished difference Result 881 states and 1160 transitions. [2022-01-10 08:18:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-01-10 08:18:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:06,322 INFO L225 Difference]: With dead ends: 881 [2022-01-10 08:18:06,322 INFO L226 Difference]: Without dead ends: 642 [2022-01-10 08:18:06,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:06,324 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:06,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 456 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-01-10 08:18:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 620. [2022-01-10 08:18:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 534 states have (on average 1.299625468164794) internal successors, (694), 540 states have internal predecessors, (694), 51 states have call successors, (51), 33 states have call predecessors, (51), 33 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-10 08:18:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 805 transitions. [2022-01-10 08:18:06,348 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 805 transitions. Word has length 57 [2022-01-10 08:18:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:06,349 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 805 transitions. [2022-01-10 08:18:06,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 805 transitions. [2022-01-10 08:18:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 08:18:06,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:06,350 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] [2022-01-10 08:18:06,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:06,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:06,559 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2022-01-10 08:18:06,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895998087] [2022-01-10 08:18:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:06,560 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:06,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:06,561 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:06,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 08:18:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:06,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:06,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:06,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:06,718 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:06,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895998087] [2022-01-10 08:18:06,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895998087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:06,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:06,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:18:06,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002687790] [2022-01-10 08:18:06,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:06,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:06,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:06,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:06,720 INFO L87 Difference]: Start difference. First operand 620 states and 805 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 08:18:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:06,758 INFO L93 Difference]: Finished difference Result 1127 states and 1428 transitions. [2022-01-10 08:18:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:06,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-01-10 08:18:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:06,763 INFO L225 Difference]: With dead ends: 1127 [2022-01-10 08:18:06,763 INFO L226 Difference]: Without dead ends: 863 [2022-01-10 08:18:06,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:06,764 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 162 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:06,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 374 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-01-10 08:18:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2022-01-10 08:18:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 733 states have (on average 1.2660300136425648) internal successors, (928), 742 states have internal predecessors, (928), 74 states have call successors, (74), 51 states have call predecessors, (74), 52 states have return successors, (84), 68 states have call predecessors, (84), 72 states have call successors, (84) [2022-01-10 08:18:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1086 transitions. [2022-01-10 08:18:06,814 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1086 transitions. Word has length 57 [2022-01-10 08:18:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:06,815 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1086 transitions. [2022-01-10 08:18:06,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 08:18:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1086 transitions. [2022-01-10 08:18:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 08:18:06,820 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:06,820 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] [2022-01-10 08:18:06,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:07,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,029 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2022-01-10 08:18:07,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:07,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119588763] [2022-01-10 08:18:07,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:07,030 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:07,031 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:07,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 08:18:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:07,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:07,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:07,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:07,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:07,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119588763] [2022-01-10 08:18:07,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119588763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:07,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:07,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:07,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651292989] [2022-01-10 08:18:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:07,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:07,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:07,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:07,166 INFO L87 Difference]: Start difference. First operand 861 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:07,212 INFO L93 Difference]: Finished difference Result 1373 states and 1783 transitions. [2022-01-10 08:18:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:07,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-01-10 08:18:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:07,217 INFO L225 Difference]: With dead ends: 1373 [2022-01-10 08:18:07,217 INFO L226 Difference]: Without dead ends: 1034 [2022-01-10 08:18:07,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:07,219 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 50 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:07,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 502 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-01-10 08:18:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2022-01-10 08:18:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 884 states have (on average 1.254524886877828) internal successors, (1109), 893 states have internal predecessors, (1109), 88 states have call successors, (88), 59 states have call predecessors, (88), 60 states have return successors, (106), 82 states have call predecessors, (106), 86 states have call successors, (106) [2022-01-10 08:18:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1303 transitions. [2022-01-10 08:18:07,263 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1303 transitions. Word has length 62 [2022-01-10 08:18:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:07,264 INFO L470 AbstractCegarLoop]: Abstraction has 1034 states and 1303 transitions. [2022-01-10 08:18:07,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1303 transitions. [2022-01-10 08:18:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 08:18:07,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:07,266 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] [2022-01-10 08:18:07,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-01-10 08:18:07,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,475 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2022-01-10 08:18:07,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:07,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783738176] [2022-01-10 08:18:07,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:07,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:07,477 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:07,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 08:18:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:07,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:07,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 08:18:07,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:07,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:07,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783738176] [2022-01-10 08:18:07,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783738176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:07,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:07,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:07,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571780682] [2022-01-10 08:18:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:07,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:07,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:07,633 INFO L87 Difference]: Start difference. First operand 1034 states and 1303 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:07,683 INFO L93 Difference]: Finished difference Result 1581 states and 2024 transitions. [2022-01-10 08:18:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:07,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-01-10 08:18:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:07,688 INFO L225 Difference]: With dead ends: 1581 [2022-01-10 08:18:07,688 INFO L226 Difference]: Without dead ends: 1161 [2022-01-10 08:18:07,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:07,690 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 184 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:07,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-01-10 08:18:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2022-01-10 08:18:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 997 states have (on average 1.2447342026078234) internal successors, (1241), 1006 states have internal predecessors, (1241), 96 states have call successors, (96), 65 states have call predecessors, (96), 66 states have return successors, (118), 90 states have call predecessors, (118), 94 states have call successors, (118) [2022-01-10 08:18:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1455 transitions. [2022-01-10 08:18:07,761 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1455 transitions. Word has length 67 [2022-01-10 08:18:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:07,761 INFO L470 AbstractCegarLoop]: Abstraction has 1161 states and 1455 transitions. [2022-01-10 08:18:07,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1455 transitions. [2022-01-10 08:18:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 08:18:07,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:07,764 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] [2022-01-10 08:18:07,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:07,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,973 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:07,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2022-01-10 08:18:07,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:07,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651402362] [2022-01-10 08:18:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:07,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:07,975 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:07,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 08:18:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:08,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:08,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 08:18:08,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:08,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:08,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651402362] [2022-01-10 08:18:08,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651402362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:08,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:08,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:08,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350241008] [2022-01-10 08:18:08,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:08,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:08,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:08,132 INFO L87 Difference]: Start difference. First operand 1161 states and 1455 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:08,202 INFO L93 Difference]: Finished difference Result 1798 states and 2300 transitions. [2022-01-10 08:18:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:08,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2022-01-10 08:18:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:08,208 INFO L225 Difference]: With dead ends: 1798 [2022-01-10 08:18:08,208 INFO L226 Difference]: Without dead ends: 1304 [2022-01-10 08:18:08,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:08,210 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 50 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:08,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 923 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-01-10 08:18:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1202. [2022-01-10 08:18:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1036 states have (on average 1.2355212355212355) internal successors, (1280), 1047 states have internal predecessors, (1280), 96 states have call successors, (96), 65 states have call predecessors, (96), 68 states have return successors, (120), 90 states have call predecessors, (120), 94 states have call successors, (120) [2022-01-10 08:18:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1496 transitions. [2022-01-10 08:18:08,265 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1496 transitions. Word has length 68 [2022-01-10 08:18:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:08,266 INFO L470 AbstractCegarLoop]: Abstraction has 1202 states and 1496 transitions. [2022-01-10 08:18:08,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1496 transitions. [2022-01-10 08:18:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 08:18:08,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:08,268 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:08,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:08,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:08,477 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash 443891125, now seen corresponding path program 1 times [2022-01-10 08:18:08,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:08,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471219566] [2022-01-10 08:18:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:08,478 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:08,479 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:08,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 08:18:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:08,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:08,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 08:18:08,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:08,624 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471219566] [2022-01-10 08:18:08,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471219566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:08,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:08,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:08,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878122375] [2022-01-10 08:18:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:08,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:08,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:08,625 INFO L87 Difference]: Start difference. First operand 1202 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:08,690 INFO L93 Difference]: Finished difference Result 1695 states and 2142 transitions. [2022-01-10 08:18:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:08,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2022-01-10 08:18:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:08,696 INFO L225 Difference]: With dead ends: 1695 [2022-01-10 08:18:08,696 INFO L226 Difference]: Without dead ends: 1113 [2022-01-10 08:18:08,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:08,700 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 10 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:08,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 895 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-01-10 08:18:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1093. [2022-01-10 08:18:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 941 states have (on average 1.2274176408076514) internal successors, (1155), 954 states have internal predecessors, (1155), 86 states have call successors, (86), 59 states have call predecessors, (86), 64 states have return successors, (106), 80 states have call predecessors, (106), 84 states have call successors, (106) [2022-01-10 08:18:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1347 transitions. [2022-01-10 08:18:08,746 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1347 transitions. Word has length 68 [2022-01-10 08:18:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:08,747 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1347 transitions. [2022-01-10 08:18:08,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1347 transitions. [2022-01-10 08:18:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 08:18:08,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:08,749 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:08,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:08,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:08,958 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:08,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1801309195, now seen corresponding path program 1 times [2022-01-10 08:18:08,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:08,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071727195] [2022-01-10 08:18:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:08,959 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:08,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:08,960 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:08,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 08:18:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:09,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:09,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:09,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:18:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 08:18:09,249 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:09,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071727195] [2022-01-10 08:18:09,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071727195] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 08:18:09,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 08:18:09,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-01-10 08:18:09,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746312077] [2022-01-10 08:18:09,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:09,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:09,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:09,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:09,251 INFO L87 Difference]: Start difference. First operand 1093 states and 1347 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:09,373 INFO L93 Difference]: Finished difference Result 1148 states and 1414 transitions. [2022-01-10 08:18:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:18:09,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-01-10 08:18:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:09,378 INFO L225 Difference]: With dead ends: 1148 [2022-01-10 08:18:09,378 INFO L226 Difference]: Without dead ends: 1145 [2022-01-10 08:18:09,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:09,379 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 380 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:09,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 317 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-01-10 08:18:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1092. [2022-01-10 08:18:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 941 states have (on average 1.2252922422954304) internal successors, (1153), 953 states have internal predecessors, (1153), 85 states have call successors, (85), 59 states have call predecessors, (85), 64 states have return successors, (106), 80 states have call predecessors, (106), 84 states have call successors, (106) [2022-01-10 08:18:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1344 transitions. [2022-01-10 08:18:09,437 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1344 transitions. Word has length 68 [2022-01-10 08:18:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:09,437 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1344 transitions. [2022-01-10 08:18:09,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1344 transitions. [2022-01-10 08:18:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 08:18:09,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:09,439 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:09,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:09,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:09,648 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash -6596234, now seen corresponding path program 1 times [2022-01-10 08:18:09,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:09,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310834571] [2022-01-10 08:18:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:09,649 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:09,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:09,650 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:09,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 08:18:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:09,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:18:09,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:10,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:18:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 08:18:10,211 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:10,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310834571] [2022-01-10 08:18:10,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310834571] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 08:18:10,211 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 08:18:10,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2022-01-10 08:18:10,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489441275] [2022-01-10 08:18:10,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 08:18:10,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 08:18:10,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 08:18:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:10,213 INFO L87 Difference]: Start difference. First operand 1092 states and 1344 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 08:18:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:10,447 INFO L93 Difference]: Finished difference Result 1915 states and 2386 transitions. [2022-01-10 08:18:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 08:18:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2022-01-10 08:18:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:10,456 INFO L225 Difference]: With dead ends: 1915 [2022-01-10 08:18:10,456 INFO L226 Difference]: Without dead ends: 1912 [2022-01-10 08:18:10,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:10,457 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 548 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:10,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 1183 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-01-10 08:18:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1441. [2022-01-10 08:18:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1254 states have (on average 1.2320574162679425) internal successors, (1545), 1272 states have internal predecessors, (1545), 104 states have call successors, (104), 72 states have call predecessors, (104), 81 states have return successors, (137), 97 states have call predecessors, (137), 103 states have call successors, (137) [2022-01-10 08:18:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1786 transitions. [2022-01-10 08:18:10,559 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1786 transitions. Word has length 69 [2022-01-10 08:18:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:10,560 INFO L470 AbstractCegarLoop]: Abstraction has 1441 states and 1786 transitions. [2022-01-10 08:18:10,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 08:18:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1786 transitions. [2022-01-10 08:18:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 08:18:10,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:10,563 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] [2022-01-10 08:18:10,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:10,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:10,772 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1822733070, now seen corresponding path program 2 times [2022-01-10 08:18:10,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:10,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499202640] [2022-01-10 08:18:10,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 08:18:10,773 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:10,774 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:10,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 08:18:10,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 08:18:10,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 08:18:10,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:10,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 08:18:10,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:10,956 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:10,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499202640] [2022-01-10 08:18:10,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499202640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:10,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:10,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:10,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373994237] [2022-01-10 08:18:10,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:10,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:10,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:10,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:10,957 INFO L87 Difference]: Start difference. First operand 1441 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 08:18:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:11,026 INFO L93 Difference]: Finished difference Result 2082 states and 2603 transitions. [2022-01-10 08:18:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-01-10 08:18:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:11,032 INFO L225 Difference]: With dead ends: 2082 [2022-01-10 08:18:11,033 INFO L226 Difference]: Without dead ends: 1331 [2022-01-10 08:18:11,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:11,035 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 187 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:11,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 331 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-01-10 08:18:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1319. [2022-01-10 08:18:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1145 states have (on average 1.2253275109170305) internal successors, (1403), 1163 states have internal predecessors, (1403), 97 states have call successors, (97), 67 states have call predecessors, (97), 75 states have return successors, (126), 89 states have call predecessors, (126), 96 states have call successors, (126) [2022-01-10 08:18:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1626 transitions. [2022-01-10 08:18:11,104 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1626 transitions. Word has length 88 [2022-01-10 08:18:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:11,104 INFO L470 AbstractCegarLoop]: Abstraction has 1319 states and 1626 transitions. [2022-01-10 08:18:11,104 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) [2022-01-10 08:18:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1626 transitions. [2022-01-10 08:18:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 08:18:11,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:11,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:11,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:11,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:11,314 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2013344195, now seen corresponding path program 1 times [2022-01-10 08:18:11,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069053178] [2022-01-10 08:18:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:11,315 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:11,316 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:11,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 08:18:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:11,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:11,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 08:18:11,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:11,521 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:11,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069053178] [2022-01-10 08:18:11,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069053178] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:11,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:11,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:18:11,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680985791] [2022-01-10 08:18:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:11,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:11,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:11,523 INFO L87 Difference]: Start difference. First operand 1319 states and 1626 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 08:18:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:11,626 INFO L93 Difference]: Finished difference Result 2208 states and 2699 transitions. [2022-01-10 08:18:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-01-10 08:18:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:11,633 INFO L225 Difference]: With dead ends: 2208 [2022-01-10 08:18:11,633 INFO L226 Difference]: Without dead ends: 1703 [2022-01-10 08:18:11,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:11,636 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 151 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:11,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 370 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-01-10 08:18:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1693. [2022-01-10 08:18:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1451 states have (on average 1.213645761543763) internal successors, (1761), 1473 states have internal predecessors, (1761), 135 states have call successors, (135), 95 states have call predecessors, (135), 105 states have return successors, (166), 125 states have call predecessors, (166), 134 states have call successors, (166) [2022-01-10 08:18:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2062 transitions. [2022-01-10 08:18:11,723 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2062 transitions. Word has length 92 [2022-01-10 08:18:11,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:11,723 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 2062 transitions. [2022-01-10 08:18:11,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 08:18:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2062 transitions. [2022-01-10 08:18:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 08:18:11,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:11,726 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] [2022-01-10 08:18:11,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:11,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:11,935 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2022-01-10 08:18:11,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:11,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442516045] [2022-01-10 08:18:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:11,936 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:11,937 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:11,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 08:18:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:11,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 08:18:11,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 08:18:12,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:12,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:12,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442516045] [2022-01-10 08:18:12,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442516045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:12,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:12,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:12,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811190087] [2022-01-10 08:18:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:12,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:12,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:12,141 INFO L87 Difference]: Start difference. First operand 1693 states and 2062 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 08:18:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:12,380 INFO L93 Difference]: Finished difference Result 3345 states and 4053 transitions. [2022-01-10 08:18:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:12,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-01-10 08:18:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:12,393 INFO L225 Difference]: With dead ends: 3345 [2022-01-10 08:18:12,394 INFO L226 Difference]: Without dead ends: 2467 [2022-01-10 08:18:12,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:12,397 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 234 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:12,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 475 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2022-01-10 08:18:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2465. [2022-01-10 08:18:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2076 states have (on average 1.1955684007707128) internal successors, (2482), 2111 states have internal predecessors, (2482), 214 states have call successors, (214), 151 states have call predecessors, (214), 173 states have return successors, (281), 204 states have call predecessors, (281), 213 states have call successors, (281) [2022-01-10 08:18:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 2977 transitions. [2022-01-10 08:18:12,557 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 2977 transitions. Word has length 92 [2022-01-10 08:18:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:12,558 INFO L470 AbstractCegarLoop]: Abstraction has 2465 states and 2977 transitions. [2022-01-10 08:18:12,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 08:18:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 2977 transitions. [2022-01-10 08:18:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 08:18:12,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:12,563 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] [2022-01-10 08:18:12,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:12,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:12,763 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2022-01-10 08:18:12,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:12,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173698164] [2022-01-10 08:18:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:12,764 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:12,766 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:12,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 08:18:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:12,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:12,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:18:12,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:12,933 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173698164] [2022-01-10 08:18:12,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173698164] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:12,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:12,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:12,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998209337] [2022-01-10 08:18:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:12,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:12,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:12,937 INFO L87 Difference]: Start difference. First operand 2465 states and 2977 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:18:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:13,032 INFO L93 Difference]: Finished difference Result 3745 states and 4484 transitions. [2022-01-10 08:18:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:13,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2022-01-10 08:18:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:13,041 INFO L225 Difference]: With dead ends: 3745 [2022-01-10 08:18:13,041 INFO L226 Difference]: Without dead ends: 2095 [2022-01-10 08:18:13,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:13,046 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 125 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:13,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 312 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-01-10 08:18:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2095. [2022-01-10 08:18:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 1777 states have (on average 1.200900393922341) internal successors, (2134), 1807 states have internal predecessors, (2134), 173 states have call successors, (173), 123 states have call predecessors, (173), 143 states have return successors, (226), 165 states have call predecessors, (226), 172 states have call successors, (226) [2022-01-10 08:18:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2533 transitions. [2022-01-10 08:18:13,180 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2533 transitions. Word has length 92 [2022-01-10 08:18:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:13,180 INFO L470 AbstractCegarLoop]: Abstraction has 2095 states and 2533 transitions. [2022-01-10 08:18:13,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:18:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2533 transitions. [2022-01-10 08:18:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 08:18:13,183 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:13,183 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] [2022-01-10 08:18:13,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-01-10 08:18:13,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:13,392 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash 172011463, now seen corresponding path program 1 times [2022-01-10 08:18:13,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:13,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445104572] [2022-01-10 08:18:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:13,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:13,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:13,394 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:13,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 08:18:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:13,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:13,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 08:18:13,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:13,551 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:13,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445104572] [2022-01-10 08:18:13,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445104572] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:13,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:13,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:13,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502401039] [2022-01-10 08:18:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:13,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:13,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:13,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:13,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:13,553 INFO L87 Difference]: Start difference. First operand 2095 states and 2533 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 08:18:13,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:13,663 INFO L93 Difference]: Finished difference Result 3188 states and 3849 transitions. [2022-01-10 08:18:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-01-10 08:18:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:13,673 INFO L225 Difference]: With dead ends: 3188 [2022-01-10 08:18:13,673 INFO L226 Difference]: Without dead ends: 2381 [2022-01-10 08:18:13,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:13,678 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 88 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:13,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 531 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2022-01-10 08:18:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2381. [2022-01-10 08:18:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2011 states have (on average 1.1924415713575336) internal successors, (2398), 2041 states have internal predecessors, (2398), 203 states have call successors, (203), 143 states have call predecessors, (203), 165 states have return successors, (268), 197 states have call predecessors, (268), 202 states have call successors, (268) [2022-01-10 08:18:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2869 transitions. [2022-01-10 08:18:13,808 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2869 transitions. Word has length 93 [2022-01-10 08:18:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:13,808 INFO L470 AbstractCegarLoop]: Abstraction has 2381 states and 2869 transitions. [2022-01-10 08:18:13,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 08:18:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2869 transitions. [2022-01-10 08:18:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 08:18:13,811 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:13,811 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] [2022-01-10 08:18:13,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:14,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:14,021 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 306128872, now seen corresponding path program 1 times [2022-01-10 08:18:14,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:14,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022487059] [2022-01-10 08:18:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:14,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:14,023 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:14,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 08:18:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:14,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:14,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 08:18:14,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:14,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:14,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022487059] [2022-01-10 08:18:14,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022487059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:14,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:14,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:14,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476892812] [2022-01-10 08:18:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:14,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:14,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:14,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:14,231 INFO L87 Difference]: Start difference. First operand 2381 states and 2869 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:14,433 INFO L93 Difference]: Finished difference Result 3211 states and 3916 transitions. [2022-01-10 08:18:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-01-10 08:18:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:14,444 INFO L225 Difference]: With dead ends: 3211 [2022-01-10 08:18:14,445 INFO L226 Difference]: Without dead ends: 2414 [2022-01-10 08:18:14,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:14,448 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 232 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:14,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 401 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2022-01-10 08:18:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2381. [2022-01-10 08:18:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2011 states have (on average 1.1849825957235207) internal successors, (2383), 2041 states have internal predecessors, (2383), 203 states have call successors, (203), 143 states have call predecessors, (203), 165 states have return successors, (267), 197 states have call predecessors, (267), 202 states have call successors, (267) [2022-01-10 08:18:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2853 transitions. [2022-01-10 08:18:14,577 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2853 transitions. Word has length 103 [2022-01-10 08:18:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:14,577 INFO L470 AbstractCegarLoop]: Abstraction has 2381 states and 2853 transitions. [2022-01-10 08:18:14,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2853 transitions. [2022-01-10 08:18:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 08:18:14,581 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:14,581 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, 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] [2022-01-10 08:18:14,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:14,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:14,790 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:14,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 793949609, now seen corresponding path program 1 times [2022-01-10 08:18:14,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:14,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036710257] [2022-01-10 08:18:14,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:14,791 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:14,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:14,792 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:14,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 08:18:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:14,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:14,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 08:18:14,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:14,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:14,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036710257] [2022-01-10 08:18:14,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036710257] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:14,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:14,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:14,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035615649] [2022-01-10 08:18:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:14,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:14,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:14,963 INFO L87 Difference]: Start difference. First operand 2381 states and 2853 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 08:18:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:15,067 INFO L93 Difference]: Finished difference Result 2705 states and 3245 transitions. [2022-01-10 08:18:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 104 [2022-01-10 08:18:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:15,073 INFO L225 Difference]: With dead ends: 2705 [2022-01-10 08:18:15,074 INFO L226 Difference]: Without dead ends: 1578 [2022-01-10 08:18:15,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:15,076 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 60 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:15,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 469 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-01-10 08:18:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2022-01-10 08:18:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1293 states have (on average 1.1670533642691416) internal successors, (1509), 1310 states have internal predecessors, (1509), 156 states have call successors, (156), 112 states have call predecessors, (156), 128 states have return successors, (194), 156 states have call predecessors, (194), 156 states have call successors, (194) [2022-01-10 08:18:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1859 transitions. [2022-01-10 08:18:15,153 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1859 transitions. Word has length 104 [2022-01-10 08:18:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:15,153 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 1859 transitions. [2022-01-10 08:18:15,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 08:18:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1859 transitions. [2022-01-10 08:18:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 08:18:15,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:15,156 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:15,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:15,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:15,365 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:15,365 INFO L85 PathProgramCache]: Analyzing trace with hash -356001562, now seen corresponding path program 1 times [2022-01-10 08:18:15,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:15,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747415335] [2022-01-10 08:18:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:15,366 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:15,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:15,367 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:15,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-01-10 08:18:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:15,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:15,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 08:18:15,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:15,602 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:15,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747415335] [2022-01-10 08:18:15,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747415335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:15,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:15,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:15,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103968298] [2022-01-10 08:18:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:15,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:15,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:15,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:15,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:15,603 INFO L87 Difference]: Start difference. First operand 1578 states and 1859 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:18:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:15,753 INFO L93 Difference]: Finished difference Result 3156 states and 3738 transitions. [2022-01-10 08:18:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:15,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 134 [2022-01-10 08:18:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:15,759 INFO L225 Difference]: With dead ends: 3156 [2022-01-10 08:18:15,759 INFO L226 Difference]: Without dead ends: 1590 [2022-01-10 08:18:15,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:15,762 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 128 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:15,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 282 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-01-10 08:18:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2022-01-10 08:18:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1301 states have (on average 1.1491160645657186) internal successors, (1495), 1320 states have internal predecessors, (1495), 156 states have call successors, (156), 112 states have call predecessors, (156), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2022-01-10 08:18:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 1833 transitions. [2022-01-10 08:18:15,868 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 1833 transitions. Word has length 134 [2022-01-10 08:18:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:15,868 INFO L470 AbstractCegarLoop]: Abstraction has 1590 states and 1833 transitions. [2022-01-10 08:18:15,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:18:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1833 transitions. [2022-01-10 08:18:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-10 08:18:15,871 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:15,872 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] [2022-01-10 08:18:15,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:16,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:16,081 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash -242597663, now seen corresponding path program 1 times [2022-01-10 08:18:16,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:16,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920948093] [2022-01-10 08:18:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:16,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:16,083 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:16,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-01-10 08:18:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:16,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:16,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 08:18:16,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:16,313 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:16,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920948093] [2022-01-10 08:18:16,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920948093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:16,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:16,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:16,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336892587] [2022-01-10 08:18:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:16,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:16,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:16,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:16,314 INFO L87 Difference]: Start difference. First operand 1590 states and 1833 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 08:18:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:16,395 INFO L93 Difference]: Finished difference Result 2854 states and 3350 transitions. [2022-01-10 08:18:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-01-10 08:18:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:16,401 INFO L225 Difference]: With dead ends: 2854 [2022-01-10 08:18:16,401 INFO L226 Difference]: Without dead ends: 1598 [2022-01-10 08:18:16,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:16,404 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 89 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:16,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 303 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2022-01-10 08:18:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1590. [2022-01-10 08:18:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1301 states have (on average 1.11837048424289) internal successors, (1455), 1320 states have internal predecessors, (1455), 156 states have call successors, (156), 112 states have call predecessors, (156), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2022-01-10 08:18:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 1793 transitions. [2022-01-10 08:18:16,487 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 1793 transitions. Word has length 135 [2022-01-10 08:18:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:16,487 INFO L470 AbstractCegarLoop]: Abstraction has 1590 states and 1793 transitions. [2022-01-10 08:18:16,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 08:18:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1793 transitions. [2022-01-10 08:18:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-10 08:18:16,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:16,490 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] [2022-01-10 08:18:16,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:16,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:16,699 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 652625369, now seen corresponding path program 1 times [2022-01-10 08:18:16,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:16,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910541775] [2022-01-10 08:18:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:16,699 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:16,700 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:16,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-01-10 08:18:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:16,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 08:18:16,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 08:18:16,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:18:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-10 08:18:17,150 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910541775] [2022-01-10 08:18:17,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910541775] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 08:18:17,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 08:18:17,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-01-10 08:18:17,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032201233] [2022-01-10 08:18:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:17,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:17,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:17,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:17,152 INFO L87 Difference]: Start difference. First operand 1590 states and 1793 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:18:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:17,347 INFO L93 Difference]: Finished difference Result 3180 states and 3600 transitions. [2022-01-10 08:18:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:18:17,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 136 [2022-01-10 08:18:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:17,357 INFO L225 Difference]: With dead ends: 3180 [2022-01-10 08:18:17,357 INFO L226 Difference]: Without dead ends: 3178 [2022-01-10 08:18:17,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:17,358 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 204 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:17,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 442 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2022-01-10 08:18:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2242. [2022-01-10 08:18:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 1837 states have (on average 1.1230266739248775) internal successors, (2063), 1862 states have internal predecessors, (2063), 220 states have call successors, (220), 156 states have call predecessors, (220), 184 states have return successors, (260), 224 states have call predecessors, (260), 220 states have call successors, (260) [2022-01-10 08:18:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2543 transitions. [2022-01-10 08:18:17,502 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2543 transitions. Word has length 136 [2022-01-10 08:18:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:17,503 INFO L470 AbstractCegarLoop]: Abstraction has 2242 states and 2543 transitions. [2022-01-10 08:18:17,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:18:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2543 transitions. [2022-01-10 08:18:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-01-10 08:18:17,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:17,507 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] [2022-01-10 08:18:17,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:17,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:17,716 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 239124213, now seen corresponding path program 1 times [2022-01-10 08:18:17,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:17,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479514346] [2022-01-10 08:18:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:17,717 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:17,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:17,718 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:17,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-01-10 08:18:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:17,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:17,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-10 08:18:18,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:18,002 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:18,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479514346] [2022-01-10 08:18:18,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479514346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:18,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:18,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:18,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601681335] [2022-01-10 08:18:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:18,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:18,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:18,004 INFO L87 Difference]: Start difference. First operand 2242 states and 2543 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:18,177 INFO L93 Difference]: Finished difference Result 5464 states and 6338 transitions. [2022-01-10 08:18:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:18,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 175 [2022-01-10 08:18:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:18,186 INFO L225 Difference]: With dead ends: 5464 [2022-01-10 08:18:18,186 INFO L226 Difference]: Without dead ends: 2962 [2022-01-10 08:18:18,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:18,191 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:18,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 258 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2022-01-10 08:18:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2950. [2022-01-10 08:18:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2413 states have (on average 1.1143804392871943) internal successors, (2689), 2448 states have internal predecessors, (2689), 292 states have call successors, (292), 208 states have call predecessors, (292), 244 states have return successors, (368), 294 states have call predecessors, (368), 292 states have call successors, (368) [2022-01-10 08:18:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3349 transitions. [2022-01-10 08:18:18,370 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3349 transitions. Word has length 175 [2022-01-10 08:18:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:18,370 INFO L470 AbstractCegarLoop]: Abstraction has 2950 states and 3349 transitions. [2022-01-10 08:18:18,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3349 transitions. [2022-01-10 08:18:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-01-10 08:18:18,374 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:18,374 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:18,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:18,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:18,583 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 113153929, now seen corresponding path program 2 times [2022-01-10 08:18:18,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692393595] [2022-01-10 08:18:18,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 08:18:18,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:18,586 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:18,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-01-10 08:18:18,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 08:18:18,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 08:18:18,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:18,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-01-10 08:18:18,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:18,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:18,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692393595] [2022-01-10 08:18:18,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692393595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:18,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:18,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:18,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179355384] [2022-01-10 08:18:18,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:18,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:18,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:18,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:18,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:18,912 INFO L87 Difference]: Start difference. First operand 2950 states and 3349 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 08:18:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:18,978 INFO L93 Difference]: Finished difference Result 4056 states and 4610 transitions. [2022-01-10 08:18:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 175 [2022-01-10 08:18:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:18,979 INFO L225 Difference]: With dead ends: 4056 [2022-01-10 08:18:18,979 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 08:18:18,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:19,000 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 86 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:19,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 310 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 08:18:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 08:18:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 08:18:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 08:18:19,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2022-01-10 08:18:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:19,001 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 08:18:19,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 08:18:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 08:18:19,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 08:18:19,004 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 08:18:19,004 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 08:18:19,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-01-10 08:18:19,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:19,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 08:18:54,122 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2022-01-10 08:18:54,122 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 706 716) the Hoare annotation is: (let ((.cse19 (= ~t1_st~0 |old(~t1_st~0)|))) (let ((.cse11 (= |old(~m_st~0)| ~m_st~0)) (.cse8 (not (= ~local~0 ~token~0))) (.cse12 (not (= (_ bv2 32) ~E_M~0))) (.cse16 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse17 (and .cse19 (= (_ bv2 32) ~m_st~0))) (.cse1 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse3 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv1 32) ~m_i~0))) (.cse5 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse6 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse10 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse18 (not (= (_ bv2 32) ~E_1~0))) (.cse13 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse14 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse15 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= (_ bv2 32) |old(~t1_st~0)|)) .cse10 (and .cse11 (= ~t1_st~0 (_ bv2 32))) .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse18 .cse13 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse14 .cse15) (or .cse0 .cse1 .cse2 (not (= (_ bv0 32) |old(~t1_st~0)|)) .cse3 .cse4 .cse6 .cse7 (and .cse11 .cse19) .cse8 (not (= (_ bv0 32) ~m_pc~0)) .cse9 .cse10 .cse12 .cse13 (not (= ~t1_pc~0 (_ bv0 32))) .cse14 .cse15) (or .cse16 .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= (_ bv1 32) ~m_pc~0) .cse18 .cse13 .cse14 .cse15)))) [2022-01-10 08:18:54,122 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2022-01-10 08:18:54,123 INFO L854 garLoopResultBuilder]: At program point L62(lines 46 64) the Hoare annotation is: (let ((.cse13 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| (_ bv0 32))) (.cse14 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32)))) (let ((.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (and .cse13 .cse14)) (.cse5 (not (= ~q_free~0 (_ bv0 32)))) (.cse6 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse7 (not (= ~t1_st~0 (_ bv0 32)))) (.cse11 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse3 (not (= (_ bv2 32) ~T1_E~0))) (.cse4 (not (= (_ bv0 32) ~m_pc~0))) (.cse8 (not (= (_ bv2 32) ~E_1~0))) (.cse9 (not (= (_ bv2 32) ~E_M~0))) (.cse16 (= (_ bv2 32) ~c_dr_st~0)) (.cse15 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse10 (not (= |old(~c_dr_st~0)| (_ bv2 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) .cse3 .cse4 (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse7 .cse8 .cse9 .cse11 .cse12 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))) (or .cse0 (and .cse13 (= ~c_dr_st~0 (_ bv0 32)) .cse14) .cse1 (not (= ~p_num_write~0 (_ bv1 32))) .cse3 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse15 .cse10) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (or .cse0 .cse3 .cse4 .cse8 .cse9 .cse16 .cse15 .cse10)))) [2022-01-10 08:18:54,123 INFO L854 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (let ((.cse8 (not (= ~q_free~0 (_ bv0 32)))) (.cse3 (not (= ~t1_st~0 (_ bv0 32)))) (.cse6 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse1 (not (= (_ bv2 32) ~T1_E~0))) (.cse2 (not (= (_ bv0 32) ~m_pc~0))) (.cse4 (not (= (_ bv2 32) ~E_1~0))) (.cse5 (not (= (_ bv2 32) ~E_M~0))) (.cse10 (= (_ bv2 32) ~c_dr_st~0)) (.cse9 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse11 (not (= |old(~c_dr_st~0)| (_ bv2 32))))) (and (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse2 (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))) (or .cse0 (not (= ~p_dw_pc~0 (_ bv0 32))) (not (= ~p_num_write~0 (_ bv1 32))) .cse1 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse2 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 (= ~c_dr_st~0 (_ bv0 32)) .cse7) (or .cse0 .cse1 .cse2 .cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse3 .cse4 .cse5 .cse10 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse9 .cse11))) [2022-01-10 08:18:54,123 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-01-10 08:18:54,123 INFO L854 garLoopResultBuilder]: At program point L81(lines 65 83) the Hoare annotation is: (let ((.cse20 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| (_ bv0 32))) (.cse18 (= |immediate_notify_threads_~tmp~0#1| (_ bv0 32))) (.cse23 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32)))) (let ((.cse14 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse16 (not (= ~q_free~0 (_ bv1 32)))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse6 (and .cse20 .cse18 .cse23)) (.cse4 (not (= ~q_free~0 (_ bv0 32)))) (.cse5 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse7 (not (= ~t1_st~0 (_ bv0 32)))) (.cse11 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse3 (not (= (_ bv0 32) ~m_pc~0))) (.cse21 (= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| (_ bv0 32))) (.cse24 (= (_ bv2 32) ~c_dr_st~0)) (.cse22 (= |immediate_notify_threads_is_do_read_c_triggered_#res#1| (_ bv0 32))) (.cse8 (not (= (_ bv2 32) ~E_1~0))) (.cse9 (not (= (_ bv2 32) ~E_M~0))) (.cse19 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse10 (not (= |old(~c_dr_st~0)| (_ bv2 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (= |old(~c_dr_st~0)| ~c_dr_st~0))) (or .cse0 (and (= ~p_dw_st~0 (_ bv0 32)) .cse13) .cse14 .cse2 .cse3 .cse7 .cse8 .cse9 .cse11 .cse12 .cse15 .cse16 .cse17 (and (= ~p_dw_st~0 (_ bv2 32)) .cse13 .cse18))) (or .cse0 .cse1 (not (= ~p_num_write~0 (_ bv1 32))) .cse2 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse3 .cse4 .cse7 .cse8 .cse9 .cse19 .cse11 (and .cse20 .cse21 .cse22 (= ~c_dr_st~0 (_ bv0 32)) .cse18 .cse23) .cse12) (or .cse0 .cse14 .cse2 .cse3 .cse7 (and .cse21 .cse22) .cse8 .cse9 .cse19 .cse11 .cse12 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse8 .cse9 .cse19 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse3 (and .cse21 .cse24 .cse22) .cse8 .cse9 .cse19 .cse10)))) [2022-01-10 08:18:54,123 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-01-10 08:18:54,123 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2022-01-10 08:18:54,123 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-01-10 08:18:54,124 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2022-01-10 08:18:54,124 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-01-10 08:18:54,124 INFO L858 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2022-01-10 08:18:54,124 INFO L854 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse14 (= (_ bv2 32) ~c_dr_st~0)) (.cse11 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse8 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~T1_E~0))) (.cse2 (not (= (_ bv0 32) ~m_pc~0))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse13 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse3 (not (= ~t1_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv2 32) ~E_1~0))) (.cse5 (not (= (_ bv2 32) ~E_M~0))) (.cse12 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse6 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32)))) (and (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse2 (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))) (or .cse0 .cse8 (not (= ~p_num_write~0 (_ bv1 32))) .cse1 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse2 .cse9 (and (= ~c_dr_st~0 (_ bv0 32)) .cse10) .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse10) (or .cse0 .cse1 .cse2 .cse9 .cse13 .cse3 .cse4 .cse5 .cse14 .cse12 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse11 .cse12) (or .cse0 .cse8 .cse1 .cse2 .cse9 .cse13 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse10))) [2022-01-10 08:18:54,124 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-01-10 08:18:54,124 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2022-01-10 08:18:54,125 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-01-10 08:18:54,125 INFO L854 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse13 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| (_ bv0 32))) (.cse15 (= |immediate_notify_threads_~tmp~0#1| (_ bv0 32))) (.cse16 (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| (_ bv0 32)))) (let ((.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse6 (and .cse13 .cse15 .cse16)) (.cse19 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse14 (= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| (_ bv0 32))) (.cse17 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse20 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse21 (not (= ~q_free~0 (_ bv1 32)))) (.cse22 (not (= ~p_last_write~0 ~c_last_read~0))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse3 (not (= (_ bv0 32) ~m_pc~0))) (.cse4 (not (= ~q_free~0 (_ bv0 32)))) (.cse5 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse7 (not (= ~t1_st~0 (_ bv0 32)))) (.cse8 (not (= (_ bv2 32) ~E_1~0))) (.cse9 (not (= (_ bv2 32) ~E_M~0))) (.cse23 (= (_ bv2 32) ~c_dr_st~0)) (.cse10 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse11 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 (not (= ~p_num_write~0 (_ bv1 32))) .cse2 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse3 .cse4 .cse7 .cse8 (and .cse13 .cse14 (= ~c_dr_st~0 (_ bv0 32)) .cse15 .cse16) .cse9 .cse17 .cse11 .cse12) (let ((.cse18 (= |old(~c_dr_st~0)| ~c_dr_st~0))) (or .cse0 (and (= ~p_dw_st~0 (_ bv0 32)) .cse18) .cse19 .cse2 .cse3 .cse7 .cse8 .cse9 .cse11 .cse12 .cse20 .cse21 .cse22 (and (= ~p_dw_st~0 (_ bv2 32)) .cse18 .cse15))) (or .cse0 .cse2 .cse3 (and .cse14 .cse23) .cse8 .cse9 .cse17 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse8 .cse9 .cse17 .cse10) (or .cse0 .cse19 .cse2 .cse3 .cse7 .cse8 .cse14 .cse9 .cse17 .cse11 .cse12 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse12)))) [2022-01-10 08:18:54,125 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-01-10 08:18:54,125 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2022-01-10 08:18:54,125 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2022-01-10 08:18:54,125 INFO L858 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2022-01-10 08:18:54,125 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 625 652) the Hoare annotation is: (let ((.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~p_last_write~0 ~c_last_read~0)) (.cse35 (= ~c_dr_pc~0 (_ bv0 32))) (.cse36 (= (_ bv2 32) ~m_st~0)) (.cse27 (= ~p_num_write~0 (_ bv0 32))) (.cse28 (= ~q_free~0 (_ bv0 32))) (.cse38 (= (_ bv1 32) ~t1_i~0)) (.cse26 (= ~c_num_read~0 (_ bv0 32))) (.cse37 (= ~t1_pc~0 (_ bv1 32))) (.cse33 (= (_ bv1 32) ~m_i~0)) (.cse39 (= ~c_dr_st~0 (_ bv0 32))) (.cse31 (= ~p_dw_st~0 (_ bv0 32))) (.cse40 (= ~p_dw_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~T1_E~0)) (.cse30 (= |old(~M_E~0)| ~M_E~0)) (.cse32 (= |old(~E_M~0)| ~E_M~0)) (.cse34 (= (_ bv2 32) ~E_1~0))) (let ((.cse20 (not (= (_ bv0 32) ~m_pc~0))) (.cse18 (not (= (_ bv0 32) ~m_st~0))) (.cse22 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse17 (and .cse29 .cse30 .cse32 .cse34)) (.cse19 (not (= ~local~0 ~token~0))) (.cse21 (not (= ~t1_st~0 (_ bv0 32)))) (.cse0 (not .cse40)) (.cse1 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse2 (not .cse31)) (.cse3 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse4 (not .cse39)) (.cse5 (not .cse33)) (.cse6 (not .cse37)) (.cse7 (not .cse26)) (.cse8 (not .cse38)) (.cse9 (not .cse28)) (.cse10 (not .cse27)) (.cse11 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse23 (not (= ~t1_st~0 (_ bv2 32)))) (.cse12 (not .cse36)) (.cse13 (not .cse35)) (.cse14 (and .cse25 (= (_ bv2 32) ~E_M~0) (= |old(~E_1~0)| ~E_1~0) .cse26 (= ~T1_E~0 |old(~T1_E~0)|) .cse27 .cse28 .cse29 .cse30 .cse24 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)) (.cse15 (not .cse25)) (.cse16 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv1 32) ~m_pc~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse21 .cse11 .cse13 .cse22 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse23 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse13 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-01-10 08:18:54,125 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2022-01-10 08:18:54,126 INFO L858 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2022-01-10 08:18:54,126 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 681 705) the Hoare annotation is: (let ((.cse24 (= ~t1_st~0 |old(~t1_st~0)|))) (let ((.cse22 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse12 (= |old(~m_st~0)| ~m_st~0)) (.cse8 (not (= ~local~0 ~token~0))) (.cse23 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse25 (not (= (_ bv0 32) ~m_pc~0))) (.cse27 (not (= |old(~m_st~0)| (_ bv0 32)))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse21 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse18 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse19 (and .cse24 (= (_ bv2 32) ~m_st~0))) (.cse1 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse3 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv1 32) ~m_i~0))) (.cse5 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse6 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse10 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse11 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse20 (not (= (_ bv2 32) ~E_1~0))) (.cse14 (not (= (_ bv2 32) ~E_M~0))) (.cse15 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse16 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13) .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse20 .cse15 .cse21 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse20 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse20 .cse14 .cse15 .cse23 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse6 .cse7 (and .cse12 .cse24) .cse8 .cse25 .cse9 .cse11 .cse14 .cse15 .cse23 .cse16 .cse17) (or (and .cse24 .cse26) .cse27 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse11 .cse20 .cse14 .cse15 .cse16 .cse17) (or .cse27 .cse0 .cse1 .cse2 (and .cse26 .cse13) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse20 .cse14 .cse15 .cse21 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 (= (_ bv1 32) ~m_pc~0) .cse20 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse20 .cse14 .cse15 .cse16 .cse17)))) [2022-01-10 08:18:54,126 INFO L854 garLoopResultBuilder]: At program point L506(lines 490 508) the Hoare annotation is: (let ((.cse14 (= |activate_threads2_is_master_triggered_~__retres1~4#1| (_ bv0 32))) (.cse15 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse30 (= (_ bv2 32) ~m_st~0)) (.cse17 (= |activate_threads2_is_master_triggered_#res#1| (_ bv0 32)))) (let ((.cse0 (not (= |old(~m_st~0)| (_ bv0 32)))) (.cse11 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse16 (= (_ bv0 32) ~m_st~0)) (.cse23 (= ~t1_st~0 (_ bv2 32))) (.cse29 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse22 (= |old(~m_st~0)| ~m_st~0)) (.cse9 (not (= (_ bv0 32) ~m_pc~0))) (.cse27 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse25 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) ~T1_E~0))) (.cse26 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv1 32) ~m_i~0))) (.cse6 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse7 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse8 (not (= (_ bv1 32) ~t1_i~0))) (.cse24 (not (= ~local~0 ~token~0))) (.cse10 (not (= ~q_free~0 (_ bv0 32)))) (.cse12 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse13 (not (= (_ bv2 32) ~E_1~0))) (.cse18 (not (= (_ bv2 32) ~E_M~0))) (.cse19 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse20 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse21 (not (= ~p_last_write~0 ~c_last_read~0))) (.cse28 (and .cse14 .cse15 .cse30 .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21) (or (and .cse14 .cse22 .cse23 .cse17) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse18 .cse19 .cse20 .cse21) (or .cse25 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse7 .cse8 .cse24 .cse10 .cse12 .cse13 .cse18 .cse19 .cse27 .cse20 .cse21 .cse28) (or .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 (= (_ bv1 32) ~m_pc~0) .cse13 .cse19 .cse20 .cse21 .cse28) (or .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse19 .cse20 .cse21 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (and .cse14 .cse16 .cse23 .cse17) .cse13 .cse18 .cse19 .cse29 .cse20 .cse21) (or .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse19 (and .cse15 (= (_ bv1 32) ~E_M~0) .cse30) .cse29 .cse20 .cse21 .cse28) (or .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse7 .cse8 (and .cse14 .cse22 .cse15 .cse17) .cse24 .cse9 .cse10 .cse12 .cse18 .cse19 .cse27 .cse20 .cse21) (or .cse25 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse10 .cse12 .cse13 .cse18 .cse19 .cse20 .cse21 .cse28)))) [2022-01-10 08:18:54,126 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2022-01-10 08:18:54,126 INFO L854 garLoopResultBuilder]: At program point L525(lines 509 527) the Hoare annotation is: (let ((.cse25 (= (_ bv0 32) ~m_st~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse26 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~p_dw_st~0 (_ bv0 32))) (.cse29 (= (_ bv1 32) ~m_i~0)) (.cse30 (= (_ bv2 32) ~E_1~0)) (.cse23 (= |activate_threads2_is_transmit1_triggered_#res#1| (_ bv0 32))) (.cse24 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse27 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| (_ bv0 32))) (.cse36 (= (_ bv2 32) ~m_st~0))) (let ((.cse21 (and .cse23 .cse24 .cse27 .cse36)) (.cse18 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse31 (and .cse23 .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse36)) (.cse19 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse8 (not (= ~local~0 ~token~0))) (.cse34 (not (= (_ bv0 32) ~m_pc~0))) (.cse12 (= |old(~m_st~0)| ~m_st~0)) (.cse22 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse33 (not (= |old(~m_st~0)| (_ bv0 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not .cse28)) (.cse2 (not .cse26)) (.cse3 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse4 (not .cse29)) (.cse5 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse6 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse35 (and .cse23 .cse25 .cse27 .cse13)) (.cse10 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse11 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse20 (not .cse30)) (.cse14 (not (= (_ bv2 32) ~E_M~0))) (.cse15 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse32 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse16 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13) .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse20 .cse14 .cse15 .cse21 .cse22 .cse16 .cse17) (or .cse18 .cse0 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse9 .cse11 .cse20 .cse15 .cse32 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse20 .cse14 .cse15 .cse21 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse20 .cse14 .cse15 .cse21 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse9 .cse11 (= (_ bv1 32) ~m_pc~0) .cse20 .cse15 .cse16 .cse17) (or .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse9 .cse35 .cse10 .cse11 .cse20 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse34 .cse9 (and .cse12 .cse23 .cse24 .cse27) .cse11 .cse14 .cse15 .cse22 .cse16 .cse17) (or .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse35 .cse10 .cse11 .cse20 .cse14 .cse15 .cse32 .cse16 .cse17)))) [2022-01-10 08:18:54,126 INFO L858 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2022-01-10 08:18:54,126 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2022-01-10 08:18:54,127 INFO L858 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2022-01-10 08:18:54,127 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2022-01-10 08:18:54,127 INFO L854 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse14 (= |activate_threads2_is_master_triggered_~__retres1~4#1| (_ bv0 32))) (.cse15 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse29 (= (_ bv2 32) ~m_st~0))) (let ((.cse9 (not (= (_ bv0 32) ~m_pc~0))) (.cse23 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse25 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse0 (not (= |old(~m_st~0)| (_ bv0 32)))) (.cse16 (= (_ bv0 32) ~m_st~0)) (.cse26 (= |old(~m_st~0)| ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv2 32))) (.cse24 (not (= ~local~0 ~token~0))) (.cse27 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse11 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse17 (not (= (_ bv2 32) ~E_M~0))) (.cse21 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse22 (and .cse14 .cse15 .cse29)) (.cse3 (not (= (_ bv2 32) ~T1_E~0))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv1 32) ~m_i~0))) (.cse6 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse7 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse8 (not (= (_ bv1 32) ~t1_i~0))) (.cse10 (not (= ~q_free~0 (_ bv0 32)))) (.cse12 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse13 (not (= (_ bv2 32) ~E_1~0))) (.cse18 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse19 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 .cse2 .cse22 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse10 .cse12 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse7 .cse8 .cse24 .cse9 .cse10 .cse12 .cse17 .cse18 .cse25 .cse19 (and .cse14 .cse26 .cse15) .cse20) (or .cse21 .cse1 .cse2 .cse22 .cse3 .cse23 .cse4 .cse5 .cse7 .cse8 .cse24 .cse10 .cse12 .cse13 .cse17 .cse18 .cse25 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse18 .cse27 (and .cse14 .cse16 .cse28) .cse19 .cse20) (or .cse1 .cse2 (and .cse14 .cse26 .cse28) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse18 (and .cse15 (= (_ bv1 32) ~E_M~0) .cse29) .cse27 .cse19 .cse20) (or .cse21 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 (= (_ bv1 32) ~m_pc~0) .cse13 .cse18 .cse19 .cse20)))) [2022-01-10 08:18:54,127 INFO L858 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2022-01-10 08:18:54,127 INFO L858 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2022-01-10 08:18:54,127 INFO L858 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2022-01-10 08:18:54,127 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2022-01-10 08:18:54,127 INFO L858 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2022-01-10 08:18:54,128 INFO L854 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse35 (= ~c_dr_pc~0 (_ bv0 32))) (.cse34 (= (_ bv2 32) ~E_1~0)) (.cse33 (= (_ bv1 32) ~m_i~0)) (.cse31 (= (_ bv2 32) ~T1_E~0)) (.cse32 (= ~p_dw_st~0 (_ bv0 32))) (.cse30 (= (_ bv0 32) ~m_st~0)) (.cse22 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse14 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| (_ bv0 32))) (.cse36 (= (_ bv2 32) ~m_st~0))) (let ((.cse12 (= |old(~m_st~0)| ~m_st~0)) (.cse9 (not (= (_ bv0 32) ~m_pc~0))) (.cse24 (and .cse13 .cse14 .cse36)) (.cse3 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse8 (not (= ~local~0 ~token~0))) (.cse17 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse26 (not (= |old(~m_st~0)| (_ bv0 32)))) (.cse21 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse15 (not (= (_ bv2 32) ~E_M~0))) (.cse27 (and .cse30 .cse14 .cse22)) (.cse29 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse23 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not .cse32)) (.cse2 (not .cse31)) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not .cse33)) (.cse20 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse6 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse10 (not (= ~q_free~0 (_ bv0 32)))) (.cse11 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse25 (not .cse34)) (.cse28 (and .cse13 .cse31 .cse14 .cse32 .cse33 .cse34 .cse35 .cse36)) (.cse16 (not .cse35)) (.cse18 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse10 .cse21 .cse11 (and .cse12 .cse22) .cse15 .cse16 .cse18 .cse19) (or .cse23 .cse0 .cse24 .cse1 .cse2 .cse4 .cse5 .cse20 .cse6 .cse7 .cse10 .cse21 .cse11 .cse25 .cse15 .cse16 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse6 .cse7 .cse9 .cse10 .cse21 .cse11 .cse25 .cse15 .cse16 .cse27 .cse18 .cse19) (or .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse6 .cse7 .cse10 .cse11 .cse25 .cse28 .cse16 .cse29 .cse18 .cse19 (and .cse13 .cse30 .cse31 .cse14 .cse32 .cse33 .cse34 .cse35)) (or .cse23 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse15 .cse16 .cse18 .cse19) (or .cse23 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse6 .cse7 .cse10 .cse21 .cse11 .cse25 .cse15 .cse16 .cse27 .cse29 .cse18 .cse19) (or .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse6 .cse7 .cse10 .cse11 (= (_ bv1 32) ~m_pc~0) .cse25 .cse28 .cse16 .cse18 .cse19)))) [2022-01-10 08:18:54,128 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2022-01-10 08:18:54,128 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2022-01-10 08:18:54,128 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2022-01-10 08:18:54,128 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,128 INFO L854 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,129 INFO L854 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,129 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 08:18:54,129 INFO L854 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2022-01-10 08:18:54,129 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-01-10 08:18:54,129 INFO L858 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2022-01-10 08:18:54,129 INFO L858 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2022-01-10 08:18:54,129 INFO L854 garLoopResultBuilder]: At program point L780(lines 764 782) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,130 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-01-10 08:18:54,130 INFO L854 garLoopResultBuilder]: At program point L483(lines 454 489) the Hoare annotation is: (let ((.cse11 (= (_ bv2 32) ~m_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse17 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~m_pc~0) .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,130 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-01-10 08:18:54,131 INFO L854 garLoopResultBuilder]: At program point L318(lines 302 320) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2022-01-10 08:18:54,131 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2022-01-10 08:18:54,131 INFO L854 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~M_E~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= (_ bv2 32) ~E_1~0)) (.cse9 (= (_ bv0 32) ~m_pc~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse12 (= ~t1_pc~0 (_ bv0 32))) (.cse13 (= ~c_dr_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 (_ bv0 32)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 (= (_ bv2 32) ~c_dr_st~0) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 (_ bv2 32)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-10 08:18:54,132 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-01-10 08:18:54,132 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-01-10 08:18:54,132 INFO L858 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2022-01-10 08:18:54,132 INFO L854 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (bvadd ~local~0 (_ bv1 32)) ~token~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~q_free~0 (_ bv0 32)) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~t1_st~0 (_ bv2 32)) (= ~t1_pc~0 (_ bv1 32)) (= (_ bv1 32) ~t1_i~0) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,132 INFO L854 garLoopResultBuilder]: At program point L798-1(lines 795 835) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,132 INFO L854 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv2 32) ~T1_E~0) (= ~p_dw_st~0 (_ bv2 32)) (= ~p_last_write~0 ~c_last_read~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~q_free~0 (_ bv1 32)) (= ~p_num_write~0 ~c_num_read~0) (= ~t1_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,132 INFO L858 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-01-10 08:18:54,132 INFO L858 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2022-01-10 08:18:54,132 INFO L854 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse4 (= (_ bv2 32) ~T1_E~0)) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~q_free~0 (_ bv1 32))) (.cse8 (= (_ bv2 32) ~c_dr_st~0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 (_ bv0 32)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 (_ bv2 32)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-01-10 08:18:54,132 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-01-10 08:18:54,132 INFO L854 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse5 (= (_ bv0 32) ~m_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= (_ bv1 32) ~t1_i~0)) (.cse13 (= ~c_dr_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv0 32) ~m_pc~0) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t1_pc~0 (_ bv1 32)) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (_ bv2 32) ~m_st~0) .cse12 .cse13 .cse14))) [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L854 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L854 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2022-01-10 08:18:54,133 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-01-10 08:18:54,134 INFO L854 garLoopResultBuilder]: At program point L851(lines 842 853) the Hoare annotation is: (= ~p_dw_st~0 (_ bv0 32)) [2022-01-10 08:18:54,134 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-01-10 08:18:54,134 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse8 (= (_ bv2 32) ~c_dr_st~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= (_ bv2 32) ~E_1~0)) (.cse7 (= (_ bv0 32) ~m_pc~0)) (.cse9 (= ~t1_pc~0 (_ bv0 32))) (.cse12 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse8 (= ~p_num_write~0 ~c_num_read~0) .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse7 .cse11 .cse8) (and .cse0 .cse1 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse2 .cse3 .cse5 (= ~p_last_write~0 ~c_last_read~0) .cse6 .cse7 .cse11 .cse10 .cse9 .cse12 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse9 .cse12))) [2022-01-10 08:18:54,134 INFO L854 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,134 INFO L854 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse11 (= (_ bv1 32) ~t1_i~0)) (.cse12 (= ~c_dr_st~0 (_ bv0 32))) (.cse13 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~t1_st~0 (_ bv2 32)) (= ~t1_pc~0 (_ bv1 32)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~t1_st~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~m_pc~0) .cse10 (= ~local~0 ~token~0) .cse11 (= ~t1_pc~0 (_ bv0 32)) .cse12 .cse13))) [2022-01-10 08:18:54,134 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse3 (= (_ bv2 32) ~E_1~0)) (.cse4 (= (_ bv0 32) ~m_pc~0)) (.cse5 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse1 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse9 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 (= ~p_num_write~0 (_ bv1 32)) (= ~c_num_read~0 (_ bv0 32)) .cse8 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))))) [2022-01-10 08:18:54,134 INFO L858 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2022-01-10 08:18:54,134 INFO L858 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2022-01-10 08:18:54,134 INFO L854 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 (_ bv0 32)) [2022-01-10 08:18:54,134 INFO L858 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2022-01-10 08:18:54,135 INFO L854 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,135 INFO L858 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2022-01-10 08:18:54,135 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-01-10 08:18:54,135 INFO L854 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2022-01-10 08:18:54,135 INFO L858 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2022-01-10 08:18:54,135 INFO L854 garLoopResultBuilder]: At program point L391(lines 386 393) the Hoare annotation is: false [2022-01-10 08:18:54,135 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2022-01-10 08:18:54,135 INFO L854 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse4 (= (_ bv2 32) ~T1_E~0)) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_num_write~0 ~c_num_read~0) .cse8) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7) (and .cse0 .cse1 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse8 (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))))) [2022-01-10 08:18:54,135 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 08:18:54,136 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2022-01-10 08:18:54,136 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2022-01-10 08:18:54,136 INFO L858 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2022-01-10 08:18:54,136 INFO L854 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,136 INFO L858 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2022-01-10 08:18:54,136 INFO L858 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2022-01-10 08:18:54,136 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2022-01-10 08:18:54,136 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-01-10 08:18:54,137 INFO L858 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2022-01-10 08:18:54,137 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-01-10 08:18:54,137 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 208) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) (= (_ bv2 32) ~T1_E~0) (= ~p_dw_st~0 (_ bv2 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~t1_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,137 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2022-01-10 08:18:54,137 INFO L861 garLoopResultBuilder]: At program point L376(lines 367 378) the Hoare annotation is: true [2022-01-10 08:18:54,137 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2022-01-10 08:18:54,137 INFO L854 garLoopResultBuilder]: At program point L723(lines 717 725) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,137 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-10 08:18:54,137 INFO L854 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,137 INFO L858 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2022-01-10 08:18:54,138 INFO L854 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2022-01-10 08:18:54,138 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2022-01-10 08:18:54,138 INFO L858 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2022-01-10 08:18:54,138 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2022-01-10 08:18:54,138 INFO L854 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (let ((.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 (= ~c_dr_pc~0 (_ bv0 32)) .cse9) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~c_dr_st~0 (_ bv0 32))))) [2022-01-10 08:18:54,138 INFO L854 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,138 INFO L858 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L854 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2022-01-10 08:18:54,139 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L854 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2022-01-10 08:18:54,139 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L858 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2022-01-10 08:18:54,139 INFO L854 garLoopResultBuilder]: At program point L462(lines 457 488) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse12 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse14 (= ~c_dr_st~0 (_ bv0 32))) (.cse15 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~local~0 ~token~0) .cse12 .cse13 .cse14 .cse15))) [2022-01-10 08:18:54,140 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,140 INFO L854 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~q_free~0 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~T1_E~0)) (.cse5 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~p_dw_st~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~m_i~0)) (.cse8 (= (_ bv2 32) ~E_1~0)) (.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~m_st~0)) (.cse11 (= ~t1_pc~0 (_ bv1 32))) (.cse12 (= (_ bv1 32) ~t1_i~0)) (.cse13 (= ~c_dr_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (_ bv1 32) ~m_pc~0)) .cse11 .cse12 .cse13 .cse14) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-10 08:18:54,140 INFO L858 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-01-10 08:18:54,140 INFO L854 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,140 INFO L854 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,140 INFO L854 garLoopResultBuilder]: At program point L364(lines 350 366) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,143 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,144 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-01-10 08:18:54,144 INFO L854 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2022-01-10 08:18:54,144 INFO L854 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,144 INFO L854 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse13 (= ~local~0 ~token~0)) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse15 (= (_ bv1 32) ~t1_i~0)) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse17 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 (= ~t1_pc~0 (_ bv0 32)) .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~t1_st~0 (_ bv2 32)) .cse14 .cse15 .cse16 .cse17))) [2022-01-10 08:18:54,144 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2022-01-10 08:18:54,144 INFO L854 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,144 INFO L854 garLoopResultBuilder]: At program point L761(lines 754 763) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2022-01-10 08:18:54,145 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-01-10 08:18:54,145 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= ~local~0 ~token~0)) (.cse11 (= (_ bv1 32) ~t1_i~0)) (.cse12 (= ~c_dr_st~0 (_ bv0 32))) (.cse13 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~t1_st~0 (_ bv2 32)) (= ~t1_pc~0 (_ bv1 32)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~t1_st~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~m_pc~0) .cse9 .cse10 .cse11 (= ~t1_pc~0 (_ bv0 32)) .cse12 .cse13))) [2022-01-10 08:18:54,145 INFO L858 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2022-01-10 08:18:54,145 INFO L858 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2022-01-10 08:18:54,145 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,145 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-01-10 08:18:54,145 INFO L854 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (let ((.cse20 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~m_st~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (_ bv1 32) ~m_pc~0)) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse14 .cse21 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 08:18:54,145 INFO L854 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse4 (= (_ bv2 32) ~T1_E~0)) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= (_ bv2 32) ~E_1~0)) (.cse7 (= (_ bv0 32) ~m_pc~0)) (.cse10 (= ~q_free~0 (_ bv1 32))) (.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (= ~p_dw_st~0 (_ bv0 32)) .cse6 .cse7 .cse10 .cse11 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7 .cse10 .cse11 .cse8))) [2022-01-10 08:18:54,145 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 228 247) no Hoare annotation was computed. [2022-01-10 08:18:54,145 INFO L861 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: true [2022-01-10 08:18:54,146 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L861 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: true [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 554 573) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2022-01-10 08:18:54,146 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2022-01-10 08:18:54,147 INFO L858 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2022-01-10 08:18:54,147 INFO L858 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2022-01-10 08:18:54,147 INFO L858 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2022-01-10 08:18:54,147 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2022-01-10 08:18:54,147 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 653 680) the Hoare annotation is: (let ((.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~p_last_write~0 ~c_last_read~0)) (.cse35 (= ~c_dr_pc~0 (_ bv0 32))) (.cse36 (= (_ bv2 32) ~m_st~0)) (.cse27 (= ~p_num_write~0 (_ bv0 32))) (.cse28 (= ~q_free~0 (_ bv0 32))) (.cse38 (= (_ bv1 32) ~t1_i~0)) (.cse26 (= ~c_num_read~0 (_ bv0 32))) (.cse37 (= ~t1_pc~0 (_ bv1 32))) (.cse33 (= (_ bv1 32) ~m_i~0)) (.cse39 (= ~c_dr_st~0 (_ bv0 32))) (.cse31 (= ~p_dw_st~0 (_ bv0 32))) (.cse40 (= ~p_dw_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~T1_E~0)) (.cse30 (= |old(~M_E~0)| ~M_E~0)) (.cse32 (= |old(~E_M~0)| ~E_M~0)) (.cse34 (= (_ bv2 32) ~E_1~0))) (let ((.cse20 (not (= (_ bv0 32) ~m_pc~0))) (.cse18 (not (= (_ bv0 32) ~m_st~0))) (.cse22 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse17 (and .cse29 .cse30 .cse32 .cse34)) (.cse19 (not (= ~local~0 ~token~0))) (.cse21 (not (= ~t1_st~0 (_ bv0 32)))) (.cse0 (not .cse40)) (.cse1 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse2 (not .cse31)) (.cse3 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse4 (not .cse39)) (.cse5 (not .cse33)) (.cse6 (not .cse37)) (.cse7 (not .cse26)) (.cse8 (not .cse38)) (.cse9 (not .cse28)) (.cse10 (not .cse27)) (.cse11 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse23 (not (= ~t1_st~0 (_ bv2 32)))) (.cse12 (not .cse36)) (.cse13 (not .cse35)) (.cse14 (and .cse25 (= (_ bv2 32) ~E_M~0) (= |old(~E_1~0)| ~E_1~0) .cse26 (= ~T1_E~0 |old(~T1_E~0)|) .cse27 .cse28 .cse29 .cse30 .cse24 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)) (.cse15 (not .cse25)) (.cse16 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv1 32) ~m_pc~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse21 .cse11 .cse13 .cse22 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse23 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse13 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-01-10 08:18:54,147 INFO L858 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2022-01-10 08:18:54,150 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2022-01-10 08:18:54,151 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 08:18:54,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:18:54 BoogieIcfgContainer [2022-01-10 08:18:54,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 08:18:54,258 INFO L158 Benchmark]: Toolchain (without parser) took 54375.33ms. Allocated memory was 188.7MB in the beginning and 549.5MB in the end (delta: 360.7MB). Free memory was 133.6MB in the beginning and 201.3MB in the end (delta: -67.7MB). Peak memory consumption was 313.6MB. Max. memory is 8.0GB. [2022-01-10 08:18:54,259 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 08:18:54,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.67ms. Allocated memory was 188.7MB in the beginning and 263.2MB in the end (delta: 74.4MB). Free memory was 133.4MB in the beginning and 232.0MB in the end (delta: -98.5MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2022-01-10 08:18:54,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.72ms. Allocated memory is still 263.2MB. Free memory was 232.0MB in the beginning and 229.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 08:18:54,263 INFO L158 Benchmark]: Boogie Preprocessor took 34.47ms. Allocated memory is still 263.2MB. Free memory was 229.4MB in the beginning and 226.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 08:18:54,263 INFO L158 Benchmark]: RCFGBuilder took 485.05ms. Allocated memory is still 263.2MB. Free memory was 226.7MB in the beginning and 205.2MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-01-10 08:18:54,263 INFO L158 Benchmark]: TraceAbstraction took 53462.79ms. Allocated memory was 263.2MB in the beginning and 549.5MB in the end (delta: 286.3MB). Free memory was 204.7MB in the beginning and 201.3MB in the end (delta: 3.4MB). Peak memory consumption was 310.6MB. Max. memory is 8.0GB. [2022-01-10 08:18:54,268 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.09ms. Allocated memory is still 188.7MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.67ms. Allocated memory was 188.7MB in the beginning and 263.2MB in the end (delta: 74.4MB). Free memory was 133.4MB in the beginning and 232.0MB in the end (delta: -98.5MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.72ms. Allocated memory is still 263.2MB. Free memory was 232.0MB in the beginning and 229.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.47ms. Allocated memory is still 263.2MB. Free memory was 229.4MB in the beginning and 226.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 485.05ms. Allocated memory is still 263.2MB. Free memory was 226.7MB in the beginning and 205.2MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 53462.79ms. Allocated memory was 263.2MB in the beginning and 549.5MB in the end (delta: 286.3MB). Free memory was 204.7MB in the beginning and 201.3MB in the end (delta: 3.4MB). Peak memory consumption was 310.6MB. Max. memory is 8.0GB. * 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: 53.3s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 34.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4994 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4912 mSDsluCounter, 14278 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7414 mSDsCounter, 391 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1385 IncrementalHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 391 mSolverCounterUnsat, 6864 mSDtfsCounter, 1385 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2672 GetRequests, 2599 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2950occurred in iteration=28, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 1814 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 4409 PreInvPairs, 5509 NumberOfFragments, 16950 HoareAnnotationTreeSize, 4409 FomulaSimplifications, 484 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 72 FomulaSimplificationsInter, 115581 FormulaSimplificationTreeSizeReductionInter, 32.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2411 NumberOfCodeBlocks, 2411 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2652 ConstructedInterpolants, 0 QuantifiedInterpolants, 4727 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4970 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 1029/1075 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: ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && t1_pc == 0bv32) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) && c_dr_st == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || (((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 0bv32 == m_st) && \result == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) && (((((((((((((((((((__retres1 == 0bv32 && \old(m_st) == m_st) && t1_st == 2bv32) && \result == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) || (((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st) && \result == 0bv32))) && ((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || 1bv32 == m_pc) || !(2bv32 == E_1)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) || (((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st) && \result == 0bv32))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) || (((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st) && \result == 0bv32))) && ((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || (((__retres1 == 0bv32 && 0bv32 == m_st) && t1_st == 2bv32) && \result == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(~bvadd16(local, 1bv32) == token)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(c_dr_pc == 0bv32)) || ((t1_st == \old(t1_st) && 1bv32 == E_M) && 2bv32 == m_st)) || !(~bvadd16(local, 1bv32) == token)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) || (((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st) && \result == 0bv32))) && (((((((((((((((((!(p_dw_pc == 0bv32) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || (((__retres1 == 0bv32 && \old(m_st) == m_st) && t1_st == \old(t1_st)) && \result == 0bv32)) || !(local == token)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) || (((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st) && \result == 0bv32)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || ((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 0bv32 == m_st)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || ((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(p_dw_pc == 0bv32) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || ((__retres1 == 0bv32 && \old(m_st) == m_st) && t1_st == \old(t1_st))) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || ((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(~bvadd16(local, 1bv32) == token)) || ((__retres1 == 0bv32 && 0bv32 == m_st) && t1_st == 2bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((!(p_dw_pc == 0bv32) || !(p_dw_st == 0bv32)) || ((__retres1 == 0bv32 && \old(m_st) == m_st) && t1_st == 2bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || ((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(c_dr_pc == 0bv32)) || ((t1_st == \old(t1_st) && 1bv32 == E_M) && 2bv32 == m_st)) || !(~bvadd16(local, 1bv32) == token)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || ((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || ((__retres1 == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == m_st)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || 1bv32 == m_pc) || !(2bv32 == E_1)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) && ((((((((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(p_num_write == 1bv32)) || !(2bv32 == T1_E)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || ((((\result == 0bv32 && __retres1 == 0bv32) && c_dr_st == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0))) && (((((((((((((!(2bv32 == M_E) || (p_dw_st == 0bv32 && \old(c_dr_st) == c_dr_st)) || !(p_num_write == c_num_read)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read)) || ((p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st) && tmp == 0bv32))) && (((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || (__retres1 == 0bv32 && 2bv32 == c_dr_st)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && ((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && (((((((((((((!(2bv32 == M_E) || !(p_num_write == c_num_read)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || __retres1 == 0bv32) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read))) && (((((((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: p_dw_st == 0bv32 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0bv32 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2bv32 == M_E) || !(p_num_write == c_num_read)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || (p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read)) && ((((((((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(p_num_write == 1bv32)) || !(2bv32 == T1_E)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || (c_dr_st == 0bv32 && __retres1 == 0bv32)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0))) && ((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32)) || __retres1 == 0bv32)) && (((((((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0))) && (((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || 2bv32 == c_dr_st) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && ((((((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || __retres1 == 0bv32) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || ((((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || (\result == 0bv32 && __retres1 == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) && ((((((((((((!(2bv32 == M_E) || !(p_num_write == c_num_read)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || (p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read))) && ((((((((((((((!(2bv32 == M_E) || ((\result == 0bv32 && c_dr_st == 0bv32) && __retres1 == 0bv32)) || !(p_dw_pc == 0bv32)) || !(p_num_write == 1bv32)) || !(2bv32 == T1_E)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0))) && ((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || (\result == 0bv32 && __retres1 == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && (((((((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0))) && (((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || 2bv32 == c_dr_st) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) && (((((((((((((!(2bv32 == M_E) || (p_dw_st == 0bv32 && \old(c_dr_st) == c_dr_st)) || !(p_num_write == c_num_read)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read)) || ((p_dw_st == 2bv32 && \old(c_dr_st) == c_dr_st) && tmp == 0bv32))) && ((((((((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(p_num_write == 1bv32)) || !(2bv32 == T1_E)) || !(c_num_read == 0bv32)) || !(\old(c_dr_st) == 0bv32)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || (((((\result == 0bv32 && __retres1 == 0bv32) && \result == 0bv32) && c_dr_st == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32)) || !(p_last_write == q_buf_0))) && (((((((((((((!(2bv32 == M_E) || !(p_num_write == c_num_read)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(t1_st == 0bv32)) || (__retres1 == 0bv32 && \result == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(2bv32 == \old(p_dw_st))) || !(q_free == 1bv32)) || !(p_last_write == c_last_read))) && ((((((((!(2bv32 == M_E) || !(p_dw_pc == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || ((\result == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32))) && (((((((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == ~bvadd16(c_num_read, 1bv32))) || !(t1_st == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || 2bv32 == c_dr_st) || !(\old(c_dr_st) == 2bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0))) && (((((((!(2bv32 == M_E) || !(2bv32 == T1_E)) || !(0bv32 == m_pc)) || ((__retres1 == 0bv32 && 2bv32 == c_dr_st) && \result == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(\old(c_dr_st) == 2bv32)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(p_dw_pc == 0bv32) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || ((\old(m_st) == m_st && t1_st == \old(t1_st)) && __retres1 == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) && ((((((((((((((((!(p_dw_pc == 0bv32) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || (\old(m_st) == m_st && t1_st == 2bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || ((t1_st == \old(t1_st) && __retres1 == 0bv32) && 2bv32 == m_st)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || ((0bv32 == m_st && __retres1 == 0bv32) && t1_st == 2bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || (((((((t1_st == \old(t1_st) && 2bv32 == T1_E) && __retres1 == 0bv32) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st)) || !(c_dr_pc == 0bv32)) || !(~bvadd16(local, 1bv32) == token)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) || (((((((t1_st == \old(t1_st) && 0bv32 == m_st) && 2bv32 == T1_E) && __retres1 == 0bv32) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32))) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || ((t1_st == \old(t1_st) && __retres1 == 0bv32) && 2bv32 == m_st)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || ((t1_st == \old(t1_st) && __retres1 == 0bv32) && 2bv32 == m_st)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || ((0bv32 == m_st && __retres1 == 0bv32) && t1_st == 2bv32)) || !(~bvadd16(local, 1bv32) == token)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || 1bv32 == m_pc) || !(2bv32 == E_1)) || (((((((t1_st == \old(t1_st) && 2bv32 == T1_E) && __retres1 == 0bv32) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && t1_pc == 0bv32) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) && c_dr_st == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && p_num_write == c_num_read) && t1_pc == 0bv32) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && t1_pc == 0bv32) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) && c_dr_st == 0bv32) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && t1_pc == 0bv32) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) && c_dr_st == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && t1_pc == 0bv32) || ((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) && c_dr_st == 0bv32) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && t1_pc == 0bv32) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) && c_dr_st == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && 2bv32 == c_dr_st) && t1_pc == 0bv32) || ((((((2bv32 == E_M && 2bv32 == M_E) && 2bv32 == T1_E) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 2bv32 == c_dr_st)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_num_write == c_num_read) && t1_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && t1_st == 0bv32) && 2bv32 == M_E) && p_num_write == ~bvadd16(c_num_read, 1bv32)) && q_free == 0bv32) && 2bv32 == T1_E) && p_dw_st == 2bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && t1_pc == 0bv32) && c_dr_st == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_dw_st == 2bv32) && p_last_write == c_last_read) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && 2bv32 == M_E) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(p_dw_pc == 0bv32) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || (\old(m_st) == m_st && t1_st == 2bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || (((\result == 0bv32 && t1_st == \old(t1_st)) && __retres1 == 0bv32) && 2bv32 == m_st)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || (((((((\result == 0bv32 && t1_st == \old(t1_st)) && 0bv32 == m_st) && 2bv32 == T1_E) && __retres1 == 0bv32) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || (((((((\result == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == T1_E) && __retres1 == 0bv32) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 2bv32 == m_st)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(c_dr_pc == 0bv32)) || !(~bvadd16(local, 1bv32) == token)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || (((\result == 0bv32 && t1_st == \old(t1_st)) && __retres1 == 0bv32) && 2bv32 == m_st)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || (((\result == 0bv32 && t1_st == \old(t1_st)) && __retres1 == 0bv32) && 2bv32 == m_st)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((!(\old(m_st) == 2bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || (((((((\result == 0bv32 && t1_st == \old(t1_st)) && 2bv32 == T1_E) && __retres1 == 0bv32) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 2bv32 == m_st)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || !(p_num_write == 0bv32)) || 1bv32 == m_pc) || !(2bv32 == E_1)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || (((\result == 0bv32 && 0bv32 == m_st) && __retres1 == 0bv32) && t1_st == 2bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && (((((((((((((((((!(p_dw_pc == 0bv32) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(0bv32 == \old(t1_st))) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(local == token)) || !(0bv32 == m_pc)) || !(q_free == 0bv32)) || (((\old(m_st) == m_st && \result == 0bv32) && t1_st == \old(t1_st)) && __retres1 == 0bv32)) || !(p_num_write == 0bv32)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(t1_pc == 0bv32)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read))) && ((((((((((((((((((!(\old(m_st) == 0bv32) || !(p_dw_pc == 0bv32)) || !(p_dw_st == 0bv32)) || !(2bv32 == T1_E)) || !(c_dr_st == 0bv32)) || !(1bv32 == m_i)) || !(t1_pc == 1bv32)) || !(c_num_read == 0bv32)) || !(1bv32 == t1_i)) || !(q_free == 0bv32)) || (((\result == 0bv32 && 0bv32 == m_st) && __retres1 == 0bv32) && t1_st == 2bv32)) || !(2bv32 == \old(t1_st))) || !(p_num_write == 0bv32)) || !(2bv32 == E_1)) || !(2bv32 == E_M)) || !(c_dr_pc == 0bv32)) || !(~bvadd16(local, 1bv32) == token)) || !(p_last_write == q_buf_0)) || !(p_last_write == c_last_read)) - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && !(1bv32 == m_pc)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || ((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && t1_st == 0bv32) && q_free == 0bv32) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && t1_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == E_M) && ~bvadd16(local, 1bv32) == token) && c_num_read == 0bv32) && p_num_write == 0bv32) && q_free == 0bv32) && 0bv32 == m_st) && 2bv32 == T1_E) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == m_i) && 2bv32 == E_1) && c_dr_pc == 0bv32) && t1_st == 2bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 08:18:54,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...